oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
On chromatic number of Latin square graphs  [PDF]
Nazli Besharati,Luis Goddyn,E. S. Mahmoodian,M. Mortezaeefar
Mathematics , 2015,
Abstract: The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Although Latin square graphs have been widely studied as strongly regular graphs, their chromatic numbers appear to be unexplored. We determine the chromatic number of a circulant Latin square, and ?nd bounds for some other classes of Latin squares. With a computer, we ?nd the chromatic number for all main classes of Latin squares of order at most eight.
On the chromatic number of structured Cayley graphs  [PDF]
Mohammad Bardestani,Keivan Mallahi-Karai
Mathematics , 2015,
Abstract: In this paper, we will study the chromatic number of Cayley graphs of algebraic groups that arise from algebraic constructions. Using Lang-Weil bound and representation theory of finite simple groups of Lie type, we will establish lower bounds on the chromatic number of these graphs. This provides a lower bound for the chromatic number of Cayley graphs of the regular graphs associated to the ring of $n\times n$ matrices over finite fields. Using Weil's bound for Kloosterman sums we will also prove an analogous result for $\mathrm{SL}_2$ over finite rings.
Bounds for the $b$-chromatic number of some families of graphs  [PDF]
Mekkia Kouider,Manouchehr Zaker
Mathematics , 2005,
Abstract: In this paper we obtain some upper bounds for $b$-chromatic number of $K_{1,t}$ -free graphs, graphs with given minimum clique partition and bipartite graphs. These bounds are in terms of either clique number or chromatic number of graphs or biclique number for bipartite graphs. We show that all the bounds are tight.
On graphs whose chromatic transversal number is two
Ayyaswamy,S.K; Natarajan,C;
Proyecciones (Antofagasta) , 2011, DOI: 10.4067/S0716-09172011000100006
Abstract: in this paper we characterize the class of trees, block graphs, cactus graphs and cubic graphs for which the chromatic transversal domination number is equal to two.
On graphs whose chromatic transversal number is two
S.K Ayyaswamy,C Natarajan
Proyecciones (Antofagasta) , 2011,
Abstract: In this paper we characterize the class of trees, block graphs, cactus graphs and cubic graphs for which the chromatic transversal domination number is equal to two.
The game chromatic number of random graphs  [PDF]
Tom Bohman,Alan Frieze,Benny Sudakov
Mathematics , 2007,
Abstract: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of G are colored. The game chromatic number \chi_g(G) is the minimum k for which the first player has a winning strategy. In this paper we analyze the asymptotic behavior of this parameter for a random graph G_{n,p}. We show that with high probability the game chromatic number of G_{n,p} is at least twice its chromatic number but, up to a multiplicative constant, has the same order of magnitude. We also study the game chromatic number of random bipartite graphs.
On the oriented chromatic number of dense graphs  [cached]
David R. Wood
Contributions to Discrete Mathematics , 2007,
Abstract: Let $G$ be a graph with $n$ vertices, $m$ edges, average degree $delta$, and maximum degree $Delta$. The emph{oriented chromatic number} of $G$ is the maximum, taken over all orientations of $G$, of the minimum number of colours in a proper vertex colouring such that between every pair of colour classes all edges have the same orientation. We investigate the oriented chromatic number of graphs, such as the hypercube, for which $deltageqlog n$. We prove that every such graph has oriented chromatic number at least $Omega(sqrt{n})$. In the case that $deltageq(2+epsilon)log n$, this lower bound is improved to $Omega(sqrt{m})$. Through a simple connection with harmonious colourings, we prove a general upper bound of $Oh{Deltasqrt{n}}$ on the oriented chromatic number. Moreover this bound is best possible for certain graphs. These lower and upper bounds are particularly close when $G$ is ($clog n$)-regular for some constant $c>2$, in which case the oriented chromatic number is between $Omega(sqrt{nlog n})$ and $mathcal{O}(sqrt{n}log n)$.
On the Oriented Chromatic Number of Dense Graphs  [PDF]
David R. Wood
Mathematics , 2006,
Abstract: Let $G$ be a graph with $n$ vertices, $m$ edges, average degree $\delta$, and maximum degree $\Delta$. The "oriented chromatic number" of $G$ is the maximum, taken over all orientations of $G$, of the minimum number of colours in a proper vertex colouring such that between every pair of colour classes all edges have the same orientation. We investigate the oriented chromatic number of graphs, such as the hypercube, for which $\delta\geq\log n$. We prove that every such graph has oriented chromatic number at least $\Omega(\sqrt{n})$. In the case that $\delta\geq(2+\epsilon)\log n$, this lower bound is improved to $\Omega(\sqrt{m})$. Through a simple connection with harmonious colourings, we prove a general upper bound of $O(\Delta\sqrt{n})$ on the oriented chromatic number. Moreover this bound is best possible for certain graphs. These lower and upper bounds are particularly close when $G$ is ($c\log n$)-regular for some constant $c>2$, in which case the oriented chromatic number is between $\Omega(\sqrt{n\log n})$ and $O(\sqrt{n}\log n)$.
Large chromatic number and Ramsey graphs  [PDF]
Csaba Biró,Zoltán Füredi,Sogol Jahanbekam
Mathematics , 2011,
Abstract: Let Q(n,c) denote the minimum clique size an n-vertex graph can have if its chromatic number is c. Using Ramsey graphs we give an exact, albeit implicit, formula for the case c is at least (n+3)/2.
On incompactness for chromatic number of graphs  [PDF]
Saharon Shelah
Mathematics , 2012,
Abstract: We deal with incompactness. Assume the existence of non-reflecting stationary set of cofinality kappa . We prove that one can define a graph G whose chromatic number is > kappa, while the chromatic number of every subgraph G' subseteq G,|G'| < |G| is <= kappa . The main case is kappa = aleph_0.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.