Vertex-Coloring with Star-Defects
From MaRDI portal
Publication:2803807
DOI10.1007/978-3-319-30139-6_4zbMath1479.05089arXiv1512.02505OpenAlexW2963794111MaRDI QIDQ2803807
Vincenzo Roselli, Michael A. Bekos, Patrizio Angelini, Michael Kaufmann
Publication date: 3 May 2016
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.02505
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On tree-partition-width
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Three short proofs in graph theory
- On tree-partitions of graphs
- Francis Guthrie: a colourful life
- Fast 3-coloring triangle-free planar graphs
- An Efficient Partitioning Oracle for Bounded-Treewidth Graphs
- Defective coloring revisited
- Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- A note on defective colorings of graphs in surfaces
- Finding a Maximum Cut of a Planar Graph in Polynomial Time