The Total Interval Number of a Graph II: Trees and Complexity
DOI10.1137/S0895480193250162zbMath0846.05052MaRDI QIDQ4881297
Thomas M. Kratzke, Douglas B. West
Publication date: 29 July 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
intersection graphcharacterizationNP-completenesstreesinterval graphsline graphsinterval numberlinear-time algorithmtrailsextremal treesmultiple-interval representationtotal interval numberAigner-Andreae bound
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
This page was built for publication: The Total Interval Number of a Graph II: Trees and Complexity