Coloring of graphs avoiding bicolored paths of a fixed length
From MaRDI portal
Publication:6604665
DOI10.1007/978-3-030-83823-2_2MaRDI QIDQ6604665
Alaittin Kırtışoğlu, Lale Ózkahya
Publication date: 13 September 2024
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved bounds on coloring of graphs
- Acyclic colorings of products of trees
- Acyclic and \(k\)-distance coloring of the grid
- On the acyclic chromatic number of Hamming graphs
- Acyclic edge-coloring using entropy compression
- Star coloring of Cartesian product of paths and cycles.
- Star coloring of graphs
- On maximal paths and circuits of graphs
- Acyclic coloring of graphs
- Acyclic colorings of planar graphs
This page was built for publication: Coloring of graphs avoiding bicolored paths of a fixed length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604665)
