Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard.
The Electronic Journal of Combinatorics [electronic only] (2004)
- Volume: 11, Issue: 1, page Research paper R46, 9 p.-Research paper R46, 9 p.
- ISSN: 1077-8926
Access Full Article
topHow to cite
topFarrugia, Alastair. "Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard.." The Electronic Journal of Combinatorics [electronic only] 11.1 (2004): Research paper R46, 9 p.-Research paper R46, 9 p.. <http://eudml.org/doc/124013>.
@article{Farrugia2004,
author = {Farrugia, Alastair},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {vertex-partitioning; line-graph; planar graph; perfect graph; NP-hard},
language = {eng},
number = {1},
pages = {Research paper R46, 9 p.-Research paper R46, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard.},
url = {http://eudml.org/doc/124013},
volume = {11},
year = {2004},
}
TY - JOUR
AU - Farrugia, Alastair
TI - Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2004
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 11
IS - 1
SP - Research paper R46, 9 p.
EP - Research paper R46, 9 p.
LA - eng
KW - vertex-partitioning; line-graph; planar graph; perfect graph; NP-hard
UR - http://eudml.org/doc/124013
ER -
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.