Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- 1 January 1970
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 18 (1) , 19-24
- https://doi.org/10.1137/0118004
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagonJournal of Combinatorial Theory, 1968
- Research problemsJournal of Combinatorial Theory, 1967