Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph (Q6201923): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Good acyclic orientations of 4‐regular 4‐connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the bandwidth conjecture of Bollobás and Komlós / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the square of a Hamiltonian cycle in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank

Latest revision as of 17:04, 28 August 2024

scientific article; zbMATH DE number 7824165
Language Label Description Also known as
English
Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph
scientific article; zbMATH DE number 7824165

    Statements

    Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph (English)
    0 references
    0 references
    0 references
    0 references
    26 March 2024
    0 references
    \(r\)-connected spanning subgraph
    0 references
    optimal minimum degree condition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references