A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs (Q521765): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.1938 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2556912289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-light-free graphs and Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cycle structure theorem for Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs / rank
 
Normal rank

Latest revision as of 16:54, 13 July 2024

scientific article
Language Label Description Also known as
English
A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs
scientific article

    Statements

    A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs (English)
    0 references
    0 references
    0 references
    12 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    cycle
    0 references
    Fan-type heavy subgraph
    0 references
    Hamilton cycle
    0 references
    pancyclicity
    0 references
    0 references