Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
type: Item
instance of: scholarly article
title: Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
zbMATH Open document ID: 1485.05150
author: Fengxia Liu
author: Baoyindureng Wu
author: Jixiang Meng
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7495519
zbMATH Keywords: arbitrarily partitionable graphs
zbMATH Keywords: arbitrarily vertex decomposable
zbMATH Keywords: threshold graphs
zbMATH Keywords: \(\{2K_2, C_4\}\)-free graphs
MaRDI profile type: Publication
full work available at URL: dmgt.2289
OpenAlex ID: W2999970536
cites work: Decomposable trees: A polynomial algorithm for tripodes
cites work: A degree bound on decomposable trees
cites work: On the shape of decomposable trees
cites work: Structural properties of recursively partitionable graphs with connectivity 2
cites work: Q5413912
cites work: Partitioning powers of traceable or Hamiltonian graphs
cites work: On the structure of arbitrarily partitionable graphs with given connectivity
cites work: Recursively arbitrarily vertex-decomposable graphs
cites work: On minimal arbitrarily partitionable graphs
cites work: On the complexity of partitioning a graph into a few connected subgraphs
cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\)
cites work: Fully decomposable split graphs
cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
cites work: Q4165164
cites work: Arbitrarily vertex decomposable caterpillars with four or five leaves
cites work: Q4193514
cites work: Q4168622
cites work: Dense arbitrarily vertex decomposable graphs
cites work: On-line arbitrarily vertex decomposable trees
cites work: Q5481324
cites work: On arbitrarily vertex decomposable trees
cites work: Dense on-line arbitrarily partitionable graphs
cites work: Dense arbitrarily partitionable graphs
cites work: Arbitrarily vertex decomposable suns with few rays
cites work: On-line arbitrarily vertex decomposable suns
cites work: A homology theory for spanning tress of a graph
cites work: Q5443779
cites work: An Ore-type condition for arbitrarily vertex decomposable graphs
cites work: Decomposing trees with large diameter
DOI: 10.7151/DMGT.2289
published in: Discussiones Mathematicae Graph Theory
Recommended article: \(2K_2\)-partition of some classes of graphs
Recommended article: On partitions of \(K_{2, 3}\)-free graphs under degree constraints
Recommended article: Partitions of multigraphs without \(C_4\)
Recommended article: Vertex partitions of \(K_{4,4}\)-minor free graphs
Recommended article: Edge Clique Partition of K 4-Free and Planar Graphs
Recommended article: On the structure of arbitrarily partitionable graphs with given connectivity
Recommended article: Q4446204
Recommended article: Q6090902
Recommended article: Q3025210
Recommended article: On subgraphs of \(C_{2k}\)-free graphs
description: scientific article; zbMATH DE number 7495519