On indicated coloring of some classes of graphs
From MaRDI portal
Publication:5919702
DOI10.1007/s00373-019-02061-yzbMath1426.05043arXiv1802.00251OpenAlexW3021895453MaRDI QIDQ5919702
No author found.
Publication date: 6 November 2019
Published in: Graphs and Combinatorics, Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.00251
2-person games (91A05) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
On indicated coloring of lexicographic product of graphs ⋮ Indicated coloring of the Mycielskian of some families of graphs
Cites Work
- Indicated coloring of matroids
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- Characterization of \(P_{6}\)-free graphs
- On indicated coloring of graphs
- A new characterization of \(P_{6}\)-free graphs
- Dominating cliques in \(P_ 5\)-free graphs
- The game coloring number of planar graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- Indicated coloring of graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- The game coloring number of planar graphs with a given girth
- On indicated chromatic number of graphs
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
- Game chromatic number of outerplanar graphs
- The game chromatic number of random graphs
This page was built for publication: On indicated coloring of some classes of graphs