On quadrilaterals in a graph

DOI10.1016/S0012-365X(99)00053-9zbMath0932.05046OpenAlexW1995770245MaRDI QIDQ1301667

Bert Randerath, Ingo Schiermeyer, Hong Wang

Publication date: 12 September 1999

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00053-9

zbMATH Keywords

minimum degreeindependent trianglesquadrilateralsindependent cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (8)

Vertex-disjoint quadrilaterals in multigraphs ⋮ Proof of the Erdős-Faudree conjecture on quadrilaterals ⋮ Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ Vertex-disjoint quadrilaterals in graphs ⋮ On 2-factors with prescribed properties in a bipartite graph ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Independent cycles with limited size in a graph
• \(H\)-factors in dense graphs
• On the maximum number of independent cycles in a bipartite graph
• On the maximal number of independent circuits in a graph

This page was built for publication: On quadrilaterals in a graph