scientific article; zbMATH DE number 2044931
From MaRDI portal
Publication:4448754
zbMATH Open1042.68628MaRDI QIDQ4448754FDOQ4448754
Bruce Reed, Guillaume Fertin, André Raspaud
Publication date: 18 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040140.htm
Title of this publication is not available (Why is that?)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cited In (41)
- From \(\chi\)- to \(\chi_p\)-bounded classes
- A polyhedral study of the acyclic coloring problem
- On chromatic numbers of two extensions of planar graphs
- Title not available (Why is that?)
- A polyhedral investigation of star colorings
- Nonrepetitive colorings of graphs of bounded tree-width
- Block colourings of star systems
- ON STAR COLORING OF DEGREE SPLITTING OF COMB PRODUCT GRAPHS
- On star coloring of modular product of graphs
- Vertex coloring without large polychromatic stars
- Title not available (Why is that?)
- Title not available (Why is that?)
- On star coloring of corona graphs
- Some results on incidence coloring, star arboricity and domination number
- Star coloring of certain graph classes
- List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs
- List star edge-coloring of subcubic graphs
- Star chromatic number of some graphs
- List star edge coloring of sparse graphs
- Star chromatic number of Harary graphs
- Title not available (Why is that?)
- Coloring with no 2-colored \(P_4\)'s
- Grad and classes with bounded expansion. I: Decompositions
- 6-Star-Coloring of Subcubic Graphs
- List star edge coloring of \(k\)-degenerate graphs
- Star list chromatic number of planar subcubic graphs
- Queue layouts of planar 3-trees
- Title not available (Why is that?)
- Star coloring of graphs with girth at least five
- The complexity of star colouring in bounded degree graphs and regular graphs
- Folding
- ON THE PALETTE INDEX OF GRAPHS HAVING A SPANNING STAR
- Star chromatic number of some graph products
- The Star and Biclique Coloring and Choosability Problems
- A polynomial time algorithm to find the star chromatic index of trees
- Upper bounds on list star chromatic index of sparse graphs
- A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
- Star coloring of graphs
- A note on star coloring of central graph of bipartite graph an corona graph of complete graph with path and cycle
- List star chromatic index of sparse graphs
- On directed labelings of stars
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 Q4448754)
