Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Vertex Coloring of Comparability+ke and –ke Graphs
verfasst von : Yasuhiko Takenaga, Kenichi Higashide
Erschienen in: Graph-Theoretic Concepts in Computer Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
$\mathcal{F}+k$
e and
$\mathcal{F}-k$
e graphs are classes of graphs close to graphs in a graph class
$\mathcal{F}$
. They are the classes of graphs obtained by adding or deleting at most
k
edges from a graph in
$\mathcal{F}$
. In this paper, we consider vertex coloring of comparability+
k
e and comparability–
k
e graphs. We show that for comparability+
k
e graphs, vertex coloring is solved in polynomial time for
k
=1 and NP-complete for
k
≥2. We also show that vertex coloring of comparability–1e graphs is solved in polynomial time.