The maximum number of edges in 2K2-free graphs of bounded degree
- 1 April 1990
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 81 (2) , 129-135
- https://doi.org/10.1016/0012-365x(90)90144-7
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- On the existence of two non-neighboring subgraphs in a graphCombinatorica, 1985
- A bound on the chromatic number of graphs without certain induced subgraphsJournal of Combinatorial Theory, Series B, 1980