Upper embeddability and connectivity of graphs (Q1257900): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycle permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4113849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4113850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4073393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773723 / rank
 
Normal rank

Revision as of 01:18, 13 June 2024

scientific article
Language Label Description Also known as
English
Upper embeddability and connectivity of graphs
scientific article

    Statements

    Upper embeddability and connectivity of graphs (English)
    0 references
    0 references
    0 references
    1979
    0 references
    Upper Embeddability
    0 references
    Connectivity
    0 references
    Graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers