Some degree bounds for the circumference of graphs (Q2568492): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths and large cycles in finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs into Open Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(D_ \lambda\)-cycles in 3-cyclable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in Graphs / rank
 
Normal rank

Revision as of 16:22, 10 June 2024

scientific article
Language Label Description Also known as
English
Some degree bounds for the circumference of graphs
scientific article

    Statements

    Some degree bounds for the circumference of graphs (English)
    0 references
    0 references
    0 references
    10 October 2005
    0 references
    The authors determine the exceptional classes of graphs for the estimate of the circumference of \(k\)-connected graphs, for \(k=3,4,5\). Furthermore, the corresponding splitting structures for \((k-1)\)-connected graphs are determined.
    0 references
    connectivity
    0 references
    exceptional classes
    0 references

    Identifiers