Covering and independence in triangle structures
Authors:
- Paul ErdösPEPaul Erdös
- Tibor GallaiTGTibor Gallai
- Zsolt TuzaZTZsolt Tuza
- 1 April 1996
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 150 (1-3) , 89-101
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Covering the cliques of a graph with verticesDiscrete Mathematics, 1992
- Extensions of Gallai's graph covering theorems for uniform hypergraphsJournal of Combinatorial Theory, Series B, 1991
- Clique-transversal sets of line graphs and complements of line graphsDiscrete Mathematics, 1991
- Covering all cliques of a graphDiscrete Mathematics, 1990
- The minimum number of triangles covering the edges of a graphJournal of Graph Theory, 1989
- Triangle-free partial graphs and edge covering theoremsDiscrete Mathematics, 1982
- A note on Ramsey numbersJournal of Combinatorial Theory, Series A, 1980
- Graph Theory and Probability. IICanadian Journal of Mathematics, 1961