Dominating cliques in P5-free graphs
- 1 December 1990
- journal article
- Published by Springer Nature in Periodica Mathematica Hungarica
- Vol. 21 (4) , 303-308
- https://doi.org/10.1007/bf02352694
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A characterization of graphs without long induced pathsJournal of Graph Theory, 1990
- The maximum number of edges in 2K2-free graphs of bounded degreeDiscrete Mathematics, 1990
- On the existence of two non-neighboring subgraphs in a graphCombinatorica, 1985
- Star-cutsets and perfect graphsJournal of Combinatorial Theory, Series B, 1985
- On a property of the class of n-colorable graphsJournal of Combinatorial Theory, Series B, 1974
- The comparability graph of a treeProceedings of the American Mathematical Society, 1962