Hadwiger Number of Graphs with Small Chordality

DOI10.1007/978-3-319-12340-0_17zbMath1417.05209arXiv1406.3812MaRDI QIDQ2945190

Christophe Paul, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof

Publication date: 9 September 2015

Published in: SIAM Journal on Discrete Mathematics, Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

cographs; AT-free graphs; Hadwiger number; bipartite permutation graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C83: Graph minors

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Uses Software

• Algorithm 97