Disjoint triangles and quadrilaterals in a graph

DOI10.1016/j.disc.2007.07.098zbMath1149.05027MaRDI QIDQ5900154

Jin Yan

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.098

zbMATH Keywords

triangle; graph; cycle; quadrilateral; disjoint

Mathematics Subject Classification ID

05C38: Paths and cycles

Related Items

Vertex-disjoint cycles containing specified vertices in a bipartite graph, Graph partition into \(K_{3}\)s and \(K_{4}\)s, Graph partition into small cliques, On 2-factors with cycles containing specified edges in a bipartite graph, On Enomoto's problems in a bipartite graph, Degree sum conditions on two disjoint cycles in graphs, Fan-type condition on disjoint cycles in a graph, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, A vertex cover with chorded 4-cycles

Cites Work

• Unnamed Item
• Vertex-disjoint quadrilaterals in graphs
• On circuits in graphs
• On quadrilaterals in a graph
• On the bipartite case of El-Zahár's conjecture
• Triangles in claw-free graphs
• \(H\)-factors in dense graphs
• On 2-factors with prescribed properties in a bipartite graph
• Degree conditions for 2-factors
• Covering a graph with cycles
• On the maximal number of independent circuits in a graph
• Graph partition problems into cycles and paths