Disjoint triangles and quadrilaterals in a graph
From MaRDI portal
Publication:5900539
DOI10.2478/s11533-008-0048-2zbMath1152.05049MaRDI QIDQ5900539
Publication date: 5 January 2009
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-008-0048-2
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Covering a graph with cycles of length at least 4
Cites Work
- Unnamed Item
- Proof of the Erdős-Faudree conjecture on quadrilaterals
- Vertex-disjoint quadrilaterals in graphs
- On circuits in graphs
- On quadrilaterals in a graph
- On the maximum number of independent cycles in a graph
- On the existence of disjoint cycles in a graph
- On the maximal number of independent circuits in a graph