Star chromatic bounds
From MaRDI portal
Publication:327688
DOI10.1016/J.ENDM.2016.05.035zbMath1347.05071OpenAlexW2513754651MaRDI QIDQ327688
Publication date: 19 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.035
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
- Acyclic and star colorings of cographs
- The strong perfect graph theorem
- Star coloring high girth planar graphs
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-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\)
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
- Star coloring of subcubic graphs
- Star coloring of graphs
- Perfect coloring and linearly χ-boundP6-free graphs
- Star coloring bipartite planar graphs
- Graph Classes: A Survey
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Acyclic colorings of planar graphs
- 25 pretty graph colouring problems
This page was built for publication: Star chromatic bounds
