Fully decomposable split graphs

DOI10.1016/j.ejc.2011.09.044zbMath1257.05125OpenAlexW2112298758MaRDI QIDQ1933640

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

Publication date: 24 January 2013

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.044

zbMATH Keywords

split graphpartitioning of a split graph

Mathematics Subject Classification ID

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

Related Items (6)

Dense on-line arbitrarily partitionable graphs ⋮ More aspects of arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ On three polynomial kernels of sequences for arbitrarily partitionable graphs ⋮ Partitioning the Cartesian product of a tree and a cycle ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

This page was built for publication: Fully decomposable split graphs