Covering a graph by topological complete subgraphs

DOI10.1007/BF01787727MaRDI QIDQ1813985zbMATHFDO

Authors 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)

Recommendations

• Small topological complete subgraphs of ``dense graphs
• scientific article; zbMATH DE number 5811
• scientific article; zbMATH DE number 26498
• The Size of a Graph Without Topological Complete Subgraphs

Cites work

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

Cited in

(4)

• Small topological complete subgraphs of ``dense graphs
• scientific article; zbMATH DE number 3972916 (Why is no real title available?)
• Extremal Graphs without Topological Complete Subgraphs
• The Size of a Graph Without Topological Complete Subgraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813985)