A New Characterization of $P_k$ P k -Free Graphs

Authors:

Publisher website

24 March 2015

journal article
Published by Springer Nature in Algorithmica

Vol. 75 (1) , 205-217
DOI:10.1007/s00453-015-9989-6

Abstract

No abstract available

Keywords

All Related Versions

Version 1, 2014-02-28, ArXiv (Unconfirmed version)

This publication has 13 references indexed in Scilit:

The price of connectivity for dominating set: Upper bounds and complexity
Discrete Applied Mathematics, 2014
Three complexity results on coloring $P_{k}$ -free graphs
European Journal of Combinatorics, 2013
A new characterization of P6-free graphs
Discrete Applied Mathematics, 2010
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
Algorithmica, 2008
Characterization of $P_{6}$ -free graphs
Discrete Applied Mathematics, 2007
3-Colorability ∈P for P6-free graphs
Discrete Applied Mathematics, 2004
Dominating subgraphs in graphs with some forbidden structures
Discrete Mathematics, 1994
Dominating cliques in P5-free graphs
Periodica Mathematica Hungarica, 1990
Dominating cliques in graphs
Discrete Mathematics, 1990
Complement reducible graphs
Discrete Applied Mathematics, 1981