Circumferences of k-connected graphs involving independence numbers (Q3174236): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A remark on two sufficient conditions for Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersections of longest cycles in \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / 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: Advances on the Hamiltonian problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles through a linear forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in graphs with prescribed stability number and connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in 3-connected graphs with given independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 12:24, 4 July 2024

scientific article
Language Label Description Also known as
English
Circumferences of k-connected graphs involving independence numbers
scientific article

    Statements

    Identifiers