Subgraphs with restricted degrees of their vertices in planar graphs (Q1584434): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected subgraphs with small degree sums in 3-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with restricted degrees of their vertices in planar 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in polytopal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural property of convex 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening of a theorem about 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Kotzig's theorem / rank
 
Normal rank

Latest revision as of 16:07, 30 May 2024

scientific article
Language Label Description Also known as
English
Subgraphs with restricted degrees of their vertices in planar graphs
scientific article

    Statements

    Subgraphs with restricted degrees of their vertices in planar graphs (English)
    0 references
    0 references
    0 references
    2 November 2000
    0 references
    path
    0 references
    projective plane graph
    0 references
    toroidal graph
    0 references
    planar graph
    0 references

    Identifiers