A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59442846, #quickstatements; #temporary_batch_1711626644914
Created claim: DBLP publication ID (P1635): journals/dm/FlandrinLMW07, #quickstatements; #temporary_batch_1731543907597
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through subsets with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through given vertices and closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and paths through specified vertices in k-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a generalisation of Ore's condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits through prescribed vertices in <i>k</i>‐connected <i>k</i>‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On paths and cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through prescribed vertices with large degree sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2‐neighborhoods and hamiltonian conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in Graphs / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dm/FlandrinLMW07 / rank
 
Normal rank

Latest revision as of 01:31, 14 November 2024

scientific article
Language Label Description Also known as
English
A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs
scientific article

    Statements

    A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 March 2007
    0 references
    Hamiltonian graphs
    0 references
    cyclability
    0 references

    Identifiers