Removable edges in cycles of a \(k\)-connected graph (Q546315): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10114-011-9278-5 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-011-9278-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973050253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally 2-connected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Construction Method For Minimally K-Edge-Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor and minimum cycle bases of a 3-connected planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizaions of critical connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncontractable 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducible chains in several types of 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable edges in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable edges in a 5-connected graph and a construction method of 5-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable edges in a cycle of a 4-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of removable edges in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of removable edges in a 4-connected graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10114-011-9278-5 / rank
 
Normal rank

Latest revision as of 21:06, 9 December 2024

scientific article
Language Label Description Also known as
English
Removable edges in cycles of a \(k\)-connected graph
scientific article

    Statements

    Removable edges in cycles of a \(k\)-connected graph (English)
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    \(k\)-connected graph
    0 references
    removable edge
    0 references
    edge-vertex-atom
    0 references

    Identifiers