Improved bounds for guarding plane graphs with edges (Q1741583): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Every Planar Map is Four Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces / 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: Guarding polyhedral terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge guarding polyhedral terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Chvatal's Watchman Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quelques consequences simples de la formule d'Euler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galleries need fewer mobile guards: A variation on Chvatal's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5358292 / rank
 
Normal rank

Revision as of 03:24, 19 July 2024

scientific article
Language Label Description Also known as
English
Improved bounds for guarding plane graphs with edges
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references