A Dirac theorem for trestles (Q427855): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: 2-connected spanning subgraphs of planar 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / 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: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2‐connected coverings of bounded degree in 3‐connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(3\)-connected plane graphs without triangular faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-connected spanning subgraphs with low maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-trestles in polyhedreal graphs / rank
 
Normal rank

Latest revision as of 09:14, 5 July 2024

scientific article
Language Label Description Also known as
English
A Dirac theorem for trestles
scientific article

    Statements

    Identifiers