Results 81 to 90 of about 269 (132)
The complexity of frugal colouring. [PDF]
Arab J Math, 2021 Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
Edge Colouring Reduced Indifference Graphs
, 1999 The chromatic index problem -- finding the minimum number of colours required for colouring the edges of a graph -- is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal ...
Celina M. H. De Figueiredo +3 more
core
On Generalized Sierpiński Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Rodríguez-Velázquez Juan Alberto +2 more
doaj +1 more source
Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
Bounds for partial list colourings
, 2008 : Let G be a simple graph on n vertices with list chromatic number χ l = s. If each vertex of G is assigned a list of t colours Albertson, Grossman and Haas [1] asked how many of the vertices, λ t,s, are necessarily colourable from these lists?
D. Hanson, G. Macgillivray, R. Haas
core
Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +1 more source
Game Chromatic Number of Graphs
, 1998 We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic ...
Xuding Zhu, Thomas Dinski
core
Decomposition of bounded degree graphs into C4-free subgraphs
We prove that every graph with maximum degree ∆ admits a partition of its edges into O(√∆) parts (as ∆→∞) none of which contains C4 as a subgraph. This bound is sharp up to a constantfactor. Our proof uses an iterated random colouring procedure.Keywords:
Kang, Ross, Perarnau Llobet, Guillem
core
Local Conditions for Edge-Coloring
, 1995 In this note, we investigate three versions of the overfull property for graphs and their relation to the edge-coloring problem. Each of these properties implies that the graph cannot be edge-colored with \Delta colors, where \Delta is the maximum degree.
Celina M. H. De Figueiredo +2 more
core
On The Equitable Chromatic Number of Complete n-Partite Graphs
, 2007 In this paper, we derive an explicit formula for the equitable chromatic number of a complete n-partite graph Kp 1 ;p 2 ;\Delta\Delta\Delta ;p n . Namely, if there exists a largest integer M such that p i (mod M) !
C. F. Zhang +3 more
core