Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 20
68,21 €
Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods. - Guarding Quadrangulations and Stacked Triangulations with Edges. - On the complexity of finding large odd induced subgraphs and odd colorings.
Jetzt bei Ebay:
