Star coloring of graphs

DOI10.1002/jgt.20029zbMath1055.05051WikidataQ56001804 ScholiaQ56001804MaRDI QIDQ3159375

Guillaume Fertin, Bruce A. Reed, Andre Raspaud

Publication date: 16 February 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20029

zbMATH Keywords

graphs; vertex coloring; star coloring; proper coloring

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

6-Star-Coloring of Subcubic Graphs, Star Chromatic Index, Coloring parameters for graphs on surfaces, A polyhedral investigation of star colorings, Star chromatic bounds, Star coloring of graphs with girth at least five, Star coloring of cubic graphs, Improved bounds on coloring of graphs, Restricted coloring problems on graphs with few \(P_4\)'s, An introduction to the discharging method via graph coloring, A survey and classification of Sierpiński-type graphs, Nonrepetitive colouring via entropy compression, Improved bounds for acyclic chromatic index of planar graphs, Frugal, acyclic and star colourings of graphs, Acyclic and star colorings of cographs, Degenerate and star colorings of graphs on surfaces, Characterisations and examples of graph classes with bounded expansion, Acyclic coloring of graphs without bichromatic long path, Acyclic improper colourings of graphs with bounded maximum degree, Acyclic and \(k\)-distance coloring of the grid, Graph coloring with cardinality constraints on the neighborhoods, Characterising bounded expansion by neighbourhood complexity, Star coloring of certain graph classes, Anagram-free graph colouring, \(\mathcal Q\)-Ramsey classes of graphs, Acyclic edge coloring of graphs with large girths, Improved upper bound for the degenerate and star chromatic numbers of graphs, Acyclic edge-coloring using entropy compression, Acyclic edge coloring of planar graphs with girth at least 5, Upward three-dimensional grid drawings of graphs, Restricted coloring problems on graphs with few, A survey of graph coloring - its types, methods and applications, Bounds on vertex colorings with restrictions on the union of color classes, A Conjecture of Borodin and a Coloring of Grünbaum, Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets, Star coloring bipartite planar graphs, Star coloring of sparse graphs

Cites Work

• Topics in Intersection Graph Theory