Cycle partition of two-connected and two-edge connected graphs (Q2516513): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1007/s11786-015-0231-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140037005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of hereditary properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path partition conjecture is true for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph into degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a cycle partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5311854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruent Graphs and the Connectivity of Graphs / rank
 
Normal rank

Latest revision as of 15:23, 10 July 2024

scientific article
Language Label Description Also known as
English
Cycle partition of two-connected and two-edge connected graphs
scientific article

    Statements

    Cycle partition of two-connected and two-edge connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 August 2015
    0 references
    \(c\)-partitionable graphs
    0 references
    two-connected graphs
    0 references
    two-edge connected graphs
    0 references
    Nielsen's conjecture
    0 references
    \(\alpha\)-partitionable graphs
    0 references
    \(\omega\)-partitionable graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references