K4−‐factor in a graph

DOI10.1002/jgt.10007zbMath0992.05059OpenAlexW4240790470MaRDI QIDQ4534211

Ken-ichi Kawarabayashi

Publication date: 30 August 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10007

zbMATH Keywords

\(K_4^-\)-factor

Mathematics Subject Classification ID

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

Related Items

Sharp minimum degree conditions for the existence of disjoint theta graphs, The minimum degree threshold for perfect graph packings, Graph factors and factorization: 1985--2003: a survey, Disjoint cycles and chorded cycles in a graph with given minimum degree, Graph Tilings in Incompatibility Systems, A vertex cover with chorded 4-cycles, Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Disjoint cliques in claw-free graphs, Minimum degree conditions for vertex-disjoint even cycles in large graphs, Combinatorial and computational aspects of graph packing and graph decomposition, The Complexity of Perfect Packings in Dense Graphs, Perfect packings with complete graphs minus an edge, Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five, The complexity of perfect matchings and packings in dense hypergraphs, \(K_{1,3}\)-factors in graphs, The extremal function for two disjoint cycles, Disjoint Even Cycles Packing, Results and problems on chorded cycles: a survey

Cites Work

• On circuits in graphs
• Vertex-disjoint claws in graphs
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture