The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits (Q705881): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs embedded in the plane with a bounded number of accumulation points / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cycle Space of an Infinite Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite cycles. I, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological paths, cycles and spanning trees in infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3229072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-connected planar spaces uniquely embed in the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity and duality of finite and infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank

Revision as of 17:11, 7 June 2024

scientific article
Language Label Description Also known as
English
The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
scientific article

    Statements

    The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits (English)
    0 references
    0 references
    16 February 2005
    0 references
    cycle space
    0 references
    peripheral circuits
    0 references

    Identifiers