Path factors and parallel knock-out schemes of almost claw-free graphs
type: Item
instance of: scholarly article
title: Path factors and parallel knock-out schemes of almost claw-free graphs
zbMATH Open document ID: 1219.05140
author: Matthew Johnson
author: Daniël Paulusma
author: Chantal Wood
published in: Discrete Mathematics
publication date: 2010-05-05T00:00:00Z
full work available at URL: 7415.pdf
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5703939
zbMATH Keywords: parallel knock-out schemes
zbMATH Keywords: (almost) claw-free graphs
zbMATH Keywords: perfect matching
zbMATH Keywords: factor
MaRDI profile type: Publication
OpenAlex ID: W2030294818
cites work: Path factors in claw-free graphs
cites work: Q4038720
cites work: Q5422499
cites work: Eliminating graphs by means of parallel knock-out schemes
cites work: Upper bounds and algorithms for parallel knock-out numbers
cites work: The computational complexity of the parallel knock-out problem
cites work: Toughness and hamiltonicity in almost claw-free graphs
cites work: Claw-free graphs---a survey
cites work: Clique partitions, graph compression and speeding-up algorithms
cites work: On the Complexity of General Graph Factor Problems
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
cites work: On partitioning the edges of graphs into connected subgraphs
cites work: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
cites work: Packing paths of length at least two
cites work: Parallel Knockouts in the Complete Graph
cites work: Q4074931
cites work: Hamiltonian cycles in almost claw-free graphs
cites work: Path-factors in the square of a tree
cites work: Graph factors and factorization: 1985--2003: a survey
cites work: Almost claw‐free graphs
cites work: 1-Factors and Antifactor Sets
cites work: Path factors of bipartite graphs
cites work: Neighborhood intersections and Hamiltonicity in almost claw-free graphs
DOI: 10.1016/J.DISC.2009.04.022
description: scientific article; zbMATH DE number 5703939