Arbitrarily partitionable \2K₂, C₄\-free graphs

DOI10.7151/DMGT.2289MaRDI QIDQ2118240zbMATH OpenOpenAlexFDO

Authors Fengxia Liu, Baoyindureng Wu, Jixiang Meng

Publication date 22 March 2022

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2289

zbMATH Keywords

\(\{2K_2, C_4\}\)-free graphsarbitrarily partitionable graphsarbitrarily vertex decomposablethreshold graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• \(2K_2\)-partition of some classes of graphs
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• Partitions of multigraphs without \(C_4\)
• Vertex partitions of \(K_{4,4}\)-minor free graphs
• Edge clique partition of \(K _{4}\)-free and planar graphs
• On the structure of arbitrarily partitionable graphs with given connectivity
• scientific article; zbMATH DE number 2032361
• scientific article; zbMATH DE number 7768372
• scientific article; zbMATH DE number 2186983
• On subgraphs of \(C_{2k}\)-free graphs

Cites work

• A degree bound on decomposable trees
• A homology theory for spanning tress of a graph
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Arbitrarily vertex decomposable suns with few rays
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Decomposable trees: A polynomial algorithm for tripodes
• Decomposing trees with large diameter
• Dense arbitrarily partitionable graphs
• Dense arbitrarily vertex decomposable graphs
• Dense on-line arbitrarily partitionable graphs
• Fully decomposable split graphs
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 6291271 (Why is no real title available?)
• scientific article; zbMATH DE number 5238175 (Why is no real title available?)
• On arbitrarily vertex decomposable trees
• On minimal arbitrarily partitionable graphs
• On the complexity of partitioning a graph into a few connected subgraphs
• On the shape of decomposable trees
• On the structure of arbitrarily partitionable graphs with given connectivity
• On-line arbitrarily vertex decomposable suns
• On-line arbitrarily vertex decomposable trees
• Partitioning powers of traceable or Hamiltonian graphs
• Recursively arbitrarily vertex-decomposable graphs
• Structural properties of recursively partitionable graphs with connectivity 2
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree

Cited in

(8)

• Partitions of multigraphs without \(C_4\)
• Dense on-line arbitrarily partitionable graphs
• 2K2 vertex-set partition into nonempty parts
• Arbitrarily partitionable product graph of star-like tree and path
• Partitioning Harary graphs into connected subgraphs containing prescribed vertices
• Closure results for arbitrarily partitionable graphs
• Partitioning vertices and edges of graphs into connected subgraphs
• Making a K₄-free graph bipartite

This page was built for publication: Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

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