Fully Decomposable Split Graphs

DOI10.1007/978-3-642-10217-2_13zbMath1267.05245OpenAlexW2179143801MaRDI QIDQ3651538

Dieter Kratsch, Gerhard J. Woeginger, Hajo J. Broersma

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/fully-decomposable-split-graphs(b907bc22-806b-4585-8ef4-4ce8cea90b25).html

zbMATH Keywords

computational complexitygraph decompositioninteger partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Dense arbitrarily partitionable graphs