K4−‐factor in a graph

DOI10.1002/JGT.10007zbMATH Open0992.05059OpenAlexW4240790470MaRDI QIDQ4534211FDOQ4534211

Authors: 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

Recommendations

• \(K_\ell^-\)-factors in graphs
• \(K_5^-\)-factor in a graph.
• \(K_{1,3}\)-factors in graphs
• Vertex-disjoint copies of K₄^-
• Exact minimum codegree threshold for \(K^-_4\)-factors

zbMATH Keywords

\(K_4^-\)-factor

Mathematics Subject Classification ID

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

Cites Work

• 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
• On circuits in graphs
• Vertex-disjoint claws in graphs

Cited In (25)

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

This page was built for publication: K₄⁻‐factor in a graph

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