Largest 2-regular subgraphs in 3-regular graphs (Q2000571): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2925142624 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1903.08795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic cage survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5338785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the size of a maximum matching in a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-edges and regular factors in regular graphs of odd degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank

Revision as of 18:40, 19 July 2024

scientific article
Language Label Description Also known as
English
Largest 2-regular subgraphs in 3-regular graphs
scientific article

    Statements

    Largest 2-regular subgraphs in 3-regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    factors in graphs
    0 references
    cubic graphs
    0 references
    cut-edges
    0 references
    0 references
    0 references