Coloring with no 2-colored \(P_4\)'s
From MaRDI portal
Publication:1883636
zbMath1053.05045MaRDI QIDQ1883636
Radhika Ramamurthi, Glenn G. Chappell, André Kündgen, Michael O. Albertson, Henry A. Kierstead
Publication date: 13 October 2004
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/124012
Related Items (76)
Star colouring of bounded degree graphs and regular graphs ⋮ A polyhedral investigation of star colorings ⋮ I,F-partitions of sparse graphs ⋮ Chromatic numbers of exact distance graphs ⋮ Boxicity of graphs on surfaces ⋮ Coloring parameters for graphs on surfaces ⋮ Star chromatic number of some graphs ⋮ Star chromatic bounds ⋮ Star Edge Coloring of Some Classes of Graphs ⋮ Star coloring of graphs with girth at least five ⋮ The complexity of restricted star colouring ⋮ On star 5-colorings of sparse graphs ⋮ On star coloring of modular product of graphs ⋮ Universal targets for homomorphisms of edge-colored graphs ⋮ Star coloring of cubic graphs ⋮ Star chromatic number of some graph products ⋮ The complexity of star colouring in bounded degree graphs and regular graphs ⋮ Injective edge-coloring of subcubic graphs ⋮ On structural parameterizations of star coloring ⋮ Acyclic vertex coloring of graphs of maximum degree 5 ⋮ Grad and classes with bounded expansion. I: Decompositions ⋮ Unnamed Item ⋮ Star 5-edge-colorings of subcubic multigraphs ⋮ Star coloring of certain graph classes ⋮ From the plane to higher surfaces ⋮ Acyclic and star colorings of cographs ⋮ Parameters Tied to Treewidth ⋮ Distance-two coloring of sparse graphs ⋮ On the tree-depth of random graphs ⋮ Intersection dimension and graph invariants ⋮ On forbidden subdivision characterizations of graph classes ⋮ On the star chromatic index of generalized Petersen graphs ⋮ On star coloring of degree splitting of join graphs ⋮ Degenerate and star colorings of graphs on surfaces ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Graph 2-rankings ⋮ Hat chromatic number of graphs ⋮ Star coloring planar graphs from small lists ⋮ Nonrepetitive colorings of graphs of bounded tree-width ⋮ On the weak 2-coloring number of planar graphs ⋮ An introduction to the discharging method via graph coloring ⋮ 6-Star-Coloring of Subcubic Graphs ⋮ Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms ⋮ Nonrepetitive colouring via entropy compression ⋮ Star Chromatic Index ⋮ On chromatic numbers of two extensions of planar graphs ⋮ \(\mathcal Q\)-Ramsey classes of graphs ⋮ On the number of 2-packings in a connected graph ⋮ A polyhedral study of the acyclic coloring problem ⋮ An upper bound for the choice number of star edge coloring of graphs ⋮ Weak acyclic coloring and asymmetric coloring games ⋮ Star list chromatic number of planar subcubic graphs ⋮ Upward three-dimensional grid drawings of graphs ⋮ Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 ⋮ On star edge colorings of bipartite and subcubic graphs ⋮ A polyhedral study of the acyclic coloring problem ⋮ Representing graphs as the intersection of cographs and threshold graphs ⋮ Acyclic, star, and injective colouring: bounding the diameter ⋮ Smaller universal targets for homomorphisms of edge-colored graphs ⋮ Acyclic, star, and injective colouring: bounding the diameter ⋮ Star coloring outerplanar bipartite graphs ⋮ Weak Unit Disk and Interval Representation of Graphs ⋮ List star edge-coloring of claw-free subcubic multigraphs ⋮ Nonrepetitive colorings of graphs ⋮ Nonrepetitive colorings of graphs ⋮ On acyclically 4-colorable maximal planar graphs ⋮ Star coloring of sparse graphs ⋮ Acyclic Vertex Coloring of Graphs of Maximum Degree Six ⋮ Intersection Dimension and Maximum Degree ⋮ Restricted coloring problems on graphs with few ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ ON STAR COLORING OF DEGREE SPLITTING OF COMB PRODUCT GRAPHS ⋮ On vertex rankings of graphs and its relatives ⋮ Equitable partition of graphs into induced forests ⋮ A Conjecture of Borodin and a Coloring of Grünbaum ⋮ Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
This page was built for publication: Coloring with no 2-colored \(P_4\)'s
