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

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

Andrzej Proskurowski, Tomáš Kaiser, Jiří Fiala, Petr A. Golovach, Daniël Paulusma, 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

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time

This page was built for publication: Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs