Heavy subgraph pairs for traceability of block-chains

DOI10.7151/dmgt.1737zbMath1290.05099OpenAlexW2088409039MaRDI QIDQ2450127

Sheng Gui Zhang, Hajo J. Broersma, Bin Long Li

Publication date: 16 May 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1737

zbMATH Keywords

Ore-type conditionforbidden subgraph\(o_{-1}\)-heavy subgraphblock-chain traceable graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Conditions for graphs to be path partition optimal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree conditions on induced claws
• Dirac's minimum degree condition restricted to claws
• Characterizing forbidden pairs for hamiltonian properties
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• The square of every two-connected graph is Hamiltonian
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
• Forbidden subgraph pairs for traceability of block-chains

This page was built for publication: Heavy subgraph pairs for traceability of block-chains