Some properties of k-trees
From MaRDI portal
Publication:708399
Recommendations
Cites work
- scientific article; zbMATH DE number 1124477 (Why is no real title available?)
- 1-tough cocomparability graphs are hamiltonian
- Finding Hamiltonian circuits in interval graphs
- Graph theory
- More than one tough chordal planar graphs are Hamiltonian
- Not every 2-tough graph is Hamiltonian
- Tough graphs and Hamiltonian circuits.
- Toughness and Hamiltonicity in \(k\)-trees
- Toughness, hamiltonicity and split graphs
Cited in
(7)- On several properties of a class of hybrid recursive trees
- Some results related to the tenacity and existence of \(k\)-trees
- Notions around tree property 1
- scientific article; zbMATH DE number 3841909 (Why is no real title available?)
- Long paths and toughness of \(k\)-trees and chordal planar graphs
- scientific article; zbMATH DE number 5551578 (Why is no real title available?)
- Properties related to the function of the number of undirected non-isomorphic trees
This page was built for publication: Some properties of \(k\)-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708399)