Three-regular parts of four-regular graphs (Q762503): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial problems which I would most like to see solved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three‐regular subgraphs of four‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank

Latest revision as of 16:56, 14 June 2024

scientific article
Language Label Description Also known as
English
Three-regular parts of four-regular graphs
scientific article

    Statements

    Three-regular parts of four-regular graphs (English)
    0 references
    0 references
    0 references
    1984
    0 references
    The well known Berge conjecture stating that every 4-regular graph contains a 3-regular subgraph is completely proved.
    0 references
    0 references
    Berge conjecture
    0 references
    4-regular graph
    0 references
    3-regular subgraph
    0 references