Fully decomposable split graphs

DOI10.1016/J.EJC.2011.09.044MaRDI QIDQ1933640zbMATH OpenOpenAlexFDO

Authors Dieter Kratsch, Hajo Broersma, Gerhard J. Woeginger

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

partitioning of a split graphsplit graph

Mathematics Subject Classification ID

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

Recommendations

• Fully decomposable split graphs
• On clique partitions of split graphs
• Decomposable trees: A polynomial algorithm for tripodes
• Prime Testing for the Split Decomposition of a Graph
• On \(P_4\)-decomposition of graphs

Cited in

(13)

• Decomposable trees: A polynomial algorithm for tripodes
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• More aspects of arbitrarily partitionable graphs
• Partitioning the Cartesian product of a tree and a cycle
• Dense on-line arbitrarily partitionable graphs
• Fully decomposable split graphs
• On three polynomial kernels of sequences for arbitrarily partitionable graphs
• Some properties of minimal arbitrarily partitionable graphs
• Closure results for arbitrarily partitionable graphs
• Arbitrarily edge-partitionable graphs
• Toughness properties of arbitrarily partitionable graphs
• Partitioning vertices and edges of graphs into connected subgraphs
• \(O(m\log n)\) split decomposition of strongly-connected graphs

This page was built for publication: Fully decomposable split graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1933640)