A note on shortest cycle covers of cubic graphs (Q2911057): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20636 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1505029522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Multigraphs by Simple Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest coverings of graphs with cycles / 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: Short cycle covers of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest circuit covers of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows and generalized coloring theorems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycle covers and the cycle double cover conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Cycle Covers of Graphs with Minimum Degree Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral decompositions of cubic graphs / rank
 
Normal rank

Latest revision as of 16:54, 5 July 2024

scientific article
Language Label Description Also known as
English
A note on shortest cycle covers of cubic graphs
scientific article

    Statements

    A note on shortest cycle covers of cubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    cycle cover
    0 references
    perfect matching
    0 references
    2-factor
    0 references
    shortest cycle cover
    0 references
    0 references