The total interval number of a graph
From MaRDI portal
Publication:1119605
DOI10.1016/0095-8956(89)90003-8zbMath0672.05050OpenAlexW2078480613MaRDI QIDQ1119605
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90003-8
Related Items
Total interval numbers of complete \(r\)-partite graphs ⋮ On the unit interval number of a graph ⋮ The total interval number of a tree and the Hamiltonian completion number of its line graph ⋮ Local search algorithms for finding the Hamiltonian completion number of line graphs ⋮ Hydras: directed hypergraphs and Horn formulas ⋮ The total interval number of a graph. I: Fundamental classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The interval number of a planar graph: Three intervals suffice
- On an extremal problem concerning the interval number of a graph
- Extremal values of the interval number of a graph, II
- Bounds of the number of disjoint spanning trees
- Extremal Values of the Interval Number of a Graph
- A Note on Sub-Eulerian Graphs
- When the cartesian product of directed cycles is Hamiltonian