Proof of the Erdős-Faudree conjecture on quadrilaterals

DOI10.1007/s00373-010-0948-3zbMath1223.05145OpenAlexW2032076435WikidataQ123252029 ScholiaQ123252029MaRDI QIDQ607681

Hong Wang

Publication date: 3 December 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0948-3

zbMATH Keywords

disjoint cycles4-Cyclescycle coverings

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (16)

Degree sum conditions on two disjoint cycles in graphs ⋮ Vertex-disjoint cycles containing specified vertices in a bipartite graph ⋮ Disjoint directed cycles with specified lengths in directed bipartite graphs ⋮ Vertex-disjoint quadrilaterals in multigraphs ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Disjoint directed cycles in directed graphs ⋮ Fan-type condition on disjoint cycles in a graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Minimum degree conditions for vertex-disjoint even cycles in large graphs ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ Covering a graph with cycles of length at least 4 ⋮ Unnamed Item ⋮ An Ore-type condition for the existence of two disjoint cycles ⋮ Tiling 3-Uniform Hypergraphs With K43−2e

Cites Work

• Vertex-disjoint quadrilaterals in graphs
• On quadrilaterals in a graph
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture

This page was built for publication: Proof of the Erdős-Faudree conjecture on quadrilaterals