Forbidden subgraphs on Hamiltonian index
From MaRDI portal
Publication:2174585
Recommendations
Cites work
- scientific article; zbMATH DE number 6500708 (Why is no real title available?)
- scientific article; zbMATH DE number 3438910 (Why is no real title available?)
- A pair of forbidden subgraphs and perfect matchings.
- A reduction method to find spanning Eulerian subgraphs
- A simple upper bound for the hamiltonian index of a graph
- Characterizing forbidden pairs for hamiltonian properties
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- Forbidden subgraphs and the Hamiltonian index of a 2-connected graph.
- Graph theory
- Hamilton cycles and closed trails in iterated line graphs
- Hamiltonian index is NP-complete
- Hamiltonian iterated line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On Hamiltonian Line-Graphs
- On stability of the hamiltonian index under contractions and closures
- The Hamiltonian index of a graph and its branch-bonds
Cited in
(4)
This page was built for publication: Forbidden subgraphs on Hamiltonian index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174585)