Covering a graph by topological complete subgraphs

DOI10.1007/BF01787727zbMath0805.05063MaRDI QIDQ1813985

Yanyan Li

Publication date: 25 June 1992

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

zbMATH Keywords

coveringstopological complete subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Partition of graphs with condition on the connectivity and minimum degree
• An Erdős-Gallai conjecture
• Relative lengths of paths and cycles in 3-connected graphs
• Triangle-free partial graphs and edge covering theorems
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Graph decomposition with applications to subdivisions and path systems modulo k
• The Representation of a Graph by Set Intersections
• Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
• Extensions of Menger's Theorem^†

This page was built for publication: Covering a graph by topological complete subgraphs