A characterization of graphs without long induced paths
Journal of Graph Theory
The maximum number of edges in 2K2-free graphs of bounded degree
Discrete Mathematics
Discrete Mathematics - Topics on domination
Domination properties and induced subgraphs
Discrete Mathematics
Dominating subgraphs in graphs with some forbidden structures
Discrete Mathematics
Graph classes: a survey
A New Characterization of P6-Free Graphs
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A new characterization of P6-free graphs
Discrete Applied Mathematics
Maximum weight independent sets in (P6,co-banner)-free graphs
Information Processing Letters
Hi-index | 0.04 |
We characterize P"6-free graphs. We also characterize graphs which are both P"t-free and C"t-free.