On the complexity of colouring antiprismatic graphs

DOI10.1007/S00453-020-00767-7OpenAlexW2981644068MaRDI QIDQ2659773

Cléophée Robin, Nicolas Trotignon, Myriam Preissmann

Publication date: 26 March 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.11001

zbMATH Keywords

algorithmclaw-free graphcoloringdichotomy

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex coloring of graphs with few obstructions
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Claw-free graphs. I: Orientable prismatic graphs
• Claw-free graphs. II: Non-orientable prismatic graphs
• Coloring Graphs Characterized by a Forbidden Subgraph
• Edge clique cover of claw‐free graphs
• Paths, Trees, and Flowers

This page was built for publication: On the complexity of colouring antiprismatic graphs