Covering a graph by topological complete subgraphs

DOI10.1007/BF01787727zbMATH Open0805.05063MaRDI QIDQ1813985FDOQ1813985

Authors: Yanyan Li 

Publication date: 25 June 1992

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

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

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

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

Cited In (4)

• Small topological complete subgraphs of ``dense graphs
• The Size of a Graph Without Topological Complete Subgraphs
• Title not available (Why is that?)
• Extremal Graphs 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)