K4−‐factor in a graph

DOI10.1002/JGT.10007MaRDI QIDQ4534211zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(K_4^-\)-factor

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(24)

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

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)