A sufficient condition for all short cycles (Q1372730): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian bipartite graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012008904 / rank
 
Normal rank

Latest revision as of 08:50, 30 July 2024

scientific article
Language Label Description Also known as
English
A sufficient condition for all short cycles
scientific article

    Statements

    A sufficient condition for all short cycles (English)
    0 references
    0 references
    18 November 1997
    0 references
    pancyclic graphs
    0 references
    Hamiltonian graph
    0 references
    bipartite graph
    0 references
    circumference
    0 references
    short cycles
    0 references
    longest cycle
    0 references

    Identifiers