Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs

DOI10.1007/978-3-642-45043-3_12zbMath1417.05200MaRDI QIDQ2864296

Daniël Paulusma, Andrzej Proskurowski, Jiří Fiala, Petr A. Golovach, Tomáš Kaiser, Hajo J. Broersma

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/14197/1/14197.pdf

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs