Hadwiger Number of Graphs with Small Chordality

From MaRDI portal
Revision as of 15:48, 2 May 2024 by EloiFerrer (talk | contribs) (EloiFerrer moved page Hadwiger Number of Graphs with Small Chordality to Hadwiger Number of Graphs with Small Chordality: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2945190


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

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

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


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)


Related Items


Uses Software


Cites Work