Graph partition into \(K_{3}\)s and \(K_{4}\)s

DOI10.1007/S12190-009-0320-ZzbMath1221.05225OpenAlexW2025080871MaRDI QIDQ711522

Jin Yan, Beibei Zhang

Publication date: 26 October 2010

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-009-0320-z

zbMATH Keywords

graphcycledegree conditionvertex disjoint

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• On the maximal number of independent triangles in graphs
• On the maximum number of independent cycles in a graph
• Degree conditions for 2-factors
• On the maximal number of independent circuits in a graph
• Disjoint triangles and quadrilaterals in a graph

This page was built for publication: Graph partition into \(K_{3}\)s and \(K_{4}\)s