scientific article; zbMATH DE number 1308943
From MaRDI portal
Publication:4255998
Cited in
(43)- Ore-type versions of Brooks' theorem
- Equitable coloring and equitable choosability of graphs with small maximum average degree
- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- Equitable coloring of three classes of 1-planar graphs
- Equitable coloring of some convex polytope graphs
- Equitable colorings of planar graphs without short cycles
- Equitable partition of planar graphs
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
- A generalization of Grötzsch Theorem on the local-equitable coloring
- Relaxed equitable colorings of planar graphs with girth at least 8
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
- On the equitable edge-coloring of 1-planar graphs and planar graphs
- Equitable colorings of corona multiproducts of graphs
- Equitable vertex arboricity of 5-degenerate graphs
- An Ore-type theorem on equitable coloring
- Equitable coloring planar graphs with large girth
- The equitable edge-colouring of outerplanar graphs
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- Equitable and list equitable colorings of planar graphs without 4-cycles
- Equitable vertex arboricity of graphs
- Equitable coloring parameters of certain graph classes
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- On equitable coloring of corona of wheels
- Equitable chromatic number of weak modular product of some graphs
- A refinement of a result of Corrádi and Hajnal
- On equitable and equitable list colorings of series-parallel graphs
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- On the equitable chromatic number of complete \(n\)-partite graphs
- Equitable colorings of Kronecker products of graphs
- Equitable and equitable list colorings of graphs
- A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS
- Equitable cluster partition of planar graphs with girth at least 12
- Equitable coloring in 1-planar graphs
- Equitable and list equitable colorings of planar graphs without 5-cycles
- Equitable coloring of graphs beyond planarity
- Equitable cluster partition of graphs with small maximum average degree
- Equitable coloring of planar graphs without 5-cycles and chordal 4-cycles
- Equitable list coloring of planar graphs with given maximum degree
- On equitable colorings of sparse graphs
- Equitable colorings of planar graphs with maximum degree at least nine
- Equitable colorings of Cartesian products of graphs
- On equitable -coloring of graphs with low average degree
- Equitable list colorings of planar graphs without short cycles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255998)