Graph partition into K₃s and K₄s

DOI10.1007/S12190-009-0320-ZMaRDI QIDQ711522zbMATHOpenAlexFDO

Authors Beibei Zhang, Jin Yan

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

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

Recommendations

• Graph partition into small cliques
• On partitions of graphs under degree constraints
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• Partitions of graphs and multigraphs under degree constraints
• Degree conditions for the partition of a graph into triangles and guadrilaterals

Cites work

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

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

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