Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets (Q3970896): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.3190140603 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090062879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On obstructions to small face covers in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781783 / rank
 
Normal rank

Latest revision as of 08:51, 15 May 2024

scientific article
Language Label Description Also known as
English
Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
scientific article

    Statements

    Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets (English)
    0 references
    0 references
    25 June 1992
    0 references
    3-connected graph
    0 references
    covering of contractible edges
    0 references

    Identifiers