Heavy subgraph pairs for traceability of block-chains
DOI10.7151/DMGT.1737zbMATH Open1290.05099OpenAlexW2088409039MaRDI QIDQ2450127FDOQ2450127
Authors: Binlong Li, Hajo Broersma, Shenggui Zhang 
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
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
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)
Cites Work
- Graph theory
- Characterizing forbidden pairs for hamiltonian properties
- The square of every two-connected graph is Hamiltonian
- Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
- Degree conditions on induced claws
- Dirac's minimum degree condition restricted to claws
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
- Forbidden subgraph pairs for traceability of block-chains
Cited In (5)
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)
