Forbidden subgraphs on Hamiltonian index
DOI10.1016/J.DISC.2020.111841zbMATH Open1437.05167OpenAlexW3004825103MaRDI QIDQ2174585FDOQ2174585
Authors: Xia Liu, Liming Xiong 
Publication date: 21 April 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.111841
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Graph theory
- A reduction method to find spanning Eulerian subgraphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Title not available (Why is that?)
- Characterizing forbidden pairs for hamiltonian properties
- A pair of forbidden subgraphs and perfect matchings.
- Hamiltonian iterated line graphs
- Hamiltonian index is NP-complete
- The Hamiltonian index of a graph and its branch-bonds
- On Hamiltonian Line-Graphs
- Hamilton cycles and closed trails in iterated line graphs
- A simple upper bound for the hamiltonian index of a graph
- On stability of the hamiltonian index under contractions and closures
- Title not available (Why is that?)
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- Forbidden subgraphs and the Hamiltonian index of a 2-connected graph.
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)
