Star coloring of certain graph classes
From MaRDI portal
Publication:1706426
DOI10.1007/s00373-017-1864-6zbMath1382.05026OpenAlexW2773943138MaRDI QIDQ1706426
Publication date: 22 March 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1864-6
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Star chromatic number of some graphs ⋮ Unnamed Item ⋮ Acyclic, star, and injective colouring: bounding the diameter ⋮ Acyclic, star, and injective colouring: bounding the diameter ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Star chromatic bounds
- Star coloring of graphs with girth at least five
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
- Acyclic and star colorings of cographs
- Degenerate and star colorings of graphs on surfaces
- The strong perfect graph theorem
- Star coloring high girth planar graphs
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- Effective on-line coloring of \(P_ 5\)-free graphs
- Trivially perfect graphs
- A description of claw-free perfect graphs
- Linear recognition of pseudo-split graphs
- Coloring the hypergraph of maximal cliques of a graph with no long path
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Coloring with no 2-colored \(P_4\)'s
- Vertex colouring and forbidden subgraphs -- a survey
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
- A characterization of perfect graphs
- On a property of the class of n-colorable graphs
- Star coloring of subcubic graphs
- Star Coloring and Acyclic Coloring of Locally Planar Graphs
- Star coloring of graphs
- Graph Theory and Probability. II
- Perfect coloring and linearly χ-boundP6-free graphs
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Star coloring bipartite planar graphs
- Graph Classes: A Survey
- 6-Star-Coloring of Subcubic Graphs
- The Structure of Claw‐Free Perfect Graphs
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Acyclic colorings of planar graphs
This page was built for publication: Star coloring of certain graph classes
