Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs-Reference-Cited by-同舟云学术

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

Published:2014-10-28 Issue:4 Volume:79 Page:282-299
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Broersma Hajo¹,Fiala Jiří²,Golovach Petr A.³,Kaiser Tomáš⁴,Paulusma Daniël⁵,Proskurowski Andrzej⁶

Affiliation:

1. FACULTY OF EEMCS; UNIVERSITY OF TWENTE; ENSCHEDE; THE NETHERLANDS

2. DEPARTMENT OF APPLIED MATHEMATICS; CHARLES UNIVERSITY; PRAGUE CZECH REPUBLIC

3. INSTITUTE OF COMPUTER SCIENCE; UNIVERSITY OF BERGEN; BERGEN NORWAY

4. DEPARTMENT OF MATHEMATICS; INSTITUTE FOR THEORETICAL COMPUTER SCIENCE (CE-ITI) AND THE EUROPEAN CENTRE OF EXCELLENCE NTIS (NEW TECHNOLOGIES FOR THE INFORMATION SOCIETY); UNIVERSITY OF WEST BOHEMIA; PLZEŇ CZECH REPUBLIC

5. SCHOOL OF ENGINEERING AND COMPUTING SCIENCES; DURHAM UNIVERSITY; UNITED KINGDOM

6. DEPARTMENT OF COMPUTER SCIENCE; UNIVERSITY OF OREGON; EUGENE OR 97403

Funder

Royal Society

Czech Science Foundation

Ministery of Education of Czech Republic

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference38 articles.

1. Linear algorithm for optimal path cover problem on interval graphs;Arikati;Inform Process Lett,1990

2. A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs;Asdre;Theor. Comp. Sci,2010

3. The 1-fixed-endpoint path cover problem is polynomial on interval graphs;Asdre;Algorithmica,2010

4. Recognizing tough graphs is NP-hard;Bauer;Discrete. Appl. Math,1990

5. Finding Hamiltonian circuits in proper interval graphs;Bertossi;Inform. Process. Lett,1983

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Semi-proper interval graphs;Discrete Applied Mathematics;2025-01

2. Characterization of interval graphs that are paired 2-disjoint path coverable;The Journal of Supercomputing;2022-08-22

3. The Scattering Number of Strictly Chordal Graphs: Linear Time Determination;Graphs and Combinatorics;2022-05-26

4. Cyclability in graph classes;Discrete Applied Mathematics;2022-05

5. Polynomial algorithms for computing the isolated toughness of interval and split graphs;Concurrency and Computation: Practice and Experience;2021-04-24