Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902513
DOI10.1007/b93953zbMath1255.05146MaRDI QIDQ5902513
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
On stable cutsets in claw-free graphs and planar graphs, Satisfactory graph partition, variants, and generalizations, Complexity of conditional colorability of graphs
