Hamiltonian jump graphs

DOI10.1016/J.DISC.2004.09.003MaRDI QIDQ1763338zbMATH OpenOpenAlexFDO

Authors Baoyindureng Wu, Jixiang Meng

Publication date 22 February 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.09.003

zbMATH Keywords

Hamilton cycleLine graphJump graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Recommendations

• A note on the jump graph of a graph
• A sufficient condition for the jump graph of a graph to be Hamiltonian
• On the planarity of iterated jump graphs
• Subgraph distances in graphs defined by edge transfers
• On perfect matchings of complements of line graphs

Cites work

• A method in graph theory
• A note on Hamiltonian circuits
• Graph theory with applications
• Note on Hamilton Circuits
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Subgraph distances in graphs defined by edge transfers

Cited in

(10)

• Monotonic star decomposition of Jump graph of cycles and even decomposition of Jump graph of complete bipartite graphs
• Jump-number of means on graphs
• On perfect matchings of complements of line graphs
• Hamiltonicity of complements of middle graphs
• Hamiltonian threshold graphs
• Spanning Eulerian subdigraphs in jump digraphs
• A note on the jump graph of a graph
• A sufficient condition for the jump graph of a graph to be Hamiltonian
• Domination number and feedback vertex number of complements of line graphs
• Super-connected and hyper-connected jump graphs

This page was built for publication: Hamiltonian jump graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763338)