The \(b\)-continuity of graphs with large girth
From MaRDI portal
Publication:1684929
DOI10.1007/s00373-017-1828-xzbMath1380.05075arXiv1602.01298OpenAlexW2963524762MaRDI QIDQ1684929
Publication date: 12 December 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.01298
Related Items (4)
Graphs with girth at least 8 are b-continuous ⋮ The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity ⋮ \(b\)-continuity and partial Grundy coloring of graphs with large girth ⋮ On the \(b\)-continuity of the lexicographic product of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the \(b\)-chromatic number of regular graphs without 4-cycle
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- \(b\)-coloring of Kneser graphs
- On \(b\)-colorings in regular graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- On \(b\)-coloring of the Kneser graphs
- On the combinatorial problems which I would most like to see solved
- The b-chromatic number of a graph
- \(b\)-coloring of tight graphs
- \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
- On the \(b\)-chromatic number of regular graphs
- Graphs of girth at least 7 have high \(b\)-chromatic number
- The \(b\)-chromatic index of graphs
- On the \(b\)-chromatic number of regular bounded graphs
- On the \(b\)-continuity property of graphs
- Upper bounds on the b-chromatic number and results for restricted graph classes
- About the b-continuity of graphs
This page was built for publication: The \(b\)-continuity of graphs with large girth
