<--- Back to Details
First PageDocument Content
Graph theory / NP-complete problems / Circle graph / Intersection graph / Dominating set / Interval graph / Chordal graph / Graph coloring / Treewidth / Claw-free graph / Clique / Planar graph
Date: 2013-05-14 08:02:16
Graph theory
NP-complete problems
Circle graph
Intersection graph
Dominating set
Interval graph
Chordal graph
Graph coloring
Treewidth
Claw-free graph
Clique
Planar graph

TOCS9478_source.nohead.pdf

Add to Reading List

Source URL: community.dur.ac.uk

Download Document from Source Website

File Size: 929,11 KB

Share Document on Facebook

Similar Documents

Graph theory / Graph coloring / Matching / Planar graphs / Line graph / Claw-free graph / Planarization / Treewidth / Acyclic coloring / Graph minor / Degeneracy

Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

DocID: 1revt - View Document

Graph theory / NP-complete problems / Circle graph / Intersection graph / Dominating set / Interval graph / Chordal graph / Graph coloring / Treewidth / Claw-free graph / Clique / Planar graph

TOCS9478_source.nohead.pdf

DocID: 1q9QC - View Document

Graph theory / Graph operations / Claw-free graph / Matching / Interval graph / Line graph / Triangle-free graph / Indifference graph / Perfect graph

The k -in-a-path problem for claw-free graphs ´ + , Bernard Lidický∗ , Jiˇrí Fiala∗ , Marcin Kaminski Daniël Paulusma∗∗ Charles University∗ Université Libre de Bruxelles+

DocID: 1pUII - View Document

NP-complete problems / Chordal graph / Bipartite graph / Clique problem / Interval graph / Claw-free graph / Clique / Graph minor / Perfect graph / Split graph / Independent set / Graph

Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1

DocID: 1oPZc - View Document

NP-complete problems / Graph operations / Graph coloring / Line graph / Dominating set / Claw-free graph / Chordal graph / Graph / Neighbourhood / Independent set / Matching / Median graph

Reconfiguring Independent Sets in Claw-Free Graphs∗ Paul Bonsma† Marcin Kami´ nski‡

DocID: 1oPvq - View Document