Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
From MaRDI portal
Publication:2118240
DOI10.7151/dmgt.2289zbMath1485.05150OpenAlexW2999970536MaRDI QIDQ2118240
Baoyindureng Wu, Fengxia Liu, Ji Xiang Meng
Publication date: 22 March 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2289
threshold graphs\(\{2K_2, C_4\}\)-free graphsarbitrarily partitionable graphsarbitrarily vertex decomposable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning powers of traceable or Hamiltonian graphs
- On minimal arbitrarily partitionable graphs
- Structural properties of recursively partitionable graphs with connectivity 2
- On the structure of arbitrarily partitionable graphs with given connectivity
- Dense arbitrarily partitionable graphs
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- Decomposing trees with large diameter
- On-line arbitrarily vertex decomposable trees
- Arbitrarily vertex decomposable suns with few rays
- On the shape of decomposable trees
- On-line arbitrarily vertex decomposable suns
- Decomposable trees: A polynomial algorithm for tripodes
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Dense arbitrarily vertex decomposable graphs
- Fully decomposable split graphs
- On the complexity of partitioning a graph into a few connected subgraphs
- Dense on-line arbitrarily partitionable graphs
- A degree bound on decomposable trees
- On arbitrarily vertex decomposable trees
- Arbitrarily vertex decomposable caterpillars with four or five leaves
- A homology theory for spanning tress of a graph
- Recursively arbitrarily vertex-decomposable graphs
- An Ore-type condition for arbitrarily vertex decomposable graphs
This page was built for publication: Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
