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

DOI10.1016/0020-0190(95)00163-8zbMATH Open0875.68674OpenAlexW2055940060MaRDI QIDQ672831FDOQ672831

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

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

zbMATH Keywords

Discrete mathematicsHamiltonian pathLine graphTreeCombinatorial problemsInterval graphGraph theoryHamiltonian completion numberTotal interval number

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On double and multiple interval graphs
• Extremal Values of the Interval Number of a Graph
• The total interval number of a graph
• Title not available (Why is that?)
• A linear algorithm for the Hamiltonian completion number of a tree

Cited In (12)

• Hamiltonian completions of sparse random graphs
• Title not available (Why is that?)
• Total interval numbers of complete \(r\)-partite graphs
• THE DEGREE PROFILE AND GINI INDEX OF RANDOM CATERPILLAR TREES
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree
• Evolutionary operators for the Hamiltonian completion problem
• A lower bound on the Hamiltonian path completion number of a line graph
• 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 cactus.
• Hydras: complexity on general graphs and a subclass of trees
• Hydras: directed hypergraphs and Horn formulas
• Local search algorithms for finding the Hamiltonian completion number of line graphs

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)