Polychromatic colorings of bounded degree plane graphs (Q3633009): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polychromatic colorings of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polychromatic colorings of rectangular partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: GUARDING RECTANGULAR PARTITIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grötzsch theorem for the hypergraph of maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 16:43, 1 July 2024

scientific article
Language Label Description Also known as
English
Polychromatic colorings of bounded degree plane graphs
scientific article

    Statements

    Polychromatic colorings of bounded degree plane graphs (English)
    0 references
    0 references
    0 references
    16 June 2009
    0 references
    plane graphs
    0 references
    vertex coloring with constraints on the faces
    0 references
    bounded degree graphs
    0 references

    Identifiers