The total interval number of a tree and the Hamiltonian completion number of its line graph

DOI10.1016/0020-0190(95)00163-8MaRDI QIDQ672831zbMATH OpenOpenAlexFDO

Authors A. Ray Chaudhuri

Publication date 28 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(95)00163-8

zbMATH Keywords

Combinatorial problemsDiscrete mathematicsGraph theoryHamiltonian completion numberHamiltonian pathInterval graphLine graphTotal interval numberTree

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• The Total Interval Number of a Graph II: Trees and Complexity
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree
• The total interval number of a graph

Cites work

• A linear algorithm for the Hamiltonian completion number of a tree
• Extremal Values of the Interval Number of a Graph
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3465355 (Why is no real title available?)
• scientific article; zbMATH DE number 3467157 (Why is no real title available?)
• On double and multiple interval graphs
• The total interval number of a graph

Cited in

(12)

• A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree
• Total interval numbers of complete \(r\)-partite graphs
• Evolutionary operators for the Hamiltonian completion problem
• Local search algorithms for finding the Hamiltonian completion number of line graphs
• Hamiltonian completions of sparse random graphs
• scientific article; zbMATH DE number 5671249 (Why is no real title available?)
• The Total Interval Number of a Graph II: Trees and Complexity
• THE DEGREE PROFILE AND GINI INDEX OF RANDOM CATERPILLAR TREES
• Hydras: complexity on general graphs and a subclass of trees
• Hydras: directed hypergraphs and Horn formulas
• A lower bound on the Hamiltonian path completion number of a line graph

This page was built for publication: The total interval number of a tree and the Hamiltonian completion number of its line graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672831)