Heavy subgraph pairs for traceability of block-chains

DOI10.7151/DMGT.1737MaRDI QIDQ2450127zbMATH OpenOpenAlexFDO

Authors Binlong Li, Hajo Broersma, Shenggui Zhang

Publication date 16 May 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

forbidden subgraphOre-type condition\(o_{-1}\)-heavy subgraphblock-chain traceable graph

Mathematics Subject Classification ID

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

Recommendations

• Forbidden subgraph pairs for traceability of block-chains
• Forbidden pairs of disconnected graphs excepting claw for traceability of block-chains.
• scientific article; zbMATH DE number 6006
• On traceability of claw-\({o_{-1}}\)-heavy graphs
• Forbidden pairs of disconnected graphs for traceability in connected graphs

Cites work

• scientific article; zbMATH DE number 4191710 (Why is no real title available?)
• scientific article; zbMATH DE number 3730183 (Why is no real title available?)
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• Characterizing forbidden pairs for hamiltonian properties
• Degree conditions on induced claws
• Dirac's minimum degree condition restricted to claws
• Forbidden subgraph pairs for traceability of block-chains
• Graph theory
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
• The square of every two-connected graph is Hamiltonian

Cited in

(5)

• Forbidden subgraph pairs for traceability of block-chains
• scientific article; zbMATH DE number 3869369 (Why is no real title available?)
• Forbidden pairs of disconnected graphs excepting claw for traceability of block-chains.
• Conditions for graphs to be path partition optimal
• On traceability of claw-\({o_{-1}}\)-heavy graphs

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

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