On classes of minimal circular-imperfect graphs

13 years 4 months ago

Download hal.archives-ouvertes.fr

Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an important class of -bound graphs with the smallest non-trivial

Arnaud Pêcher, Annegret Wagler

Real-time Traffic

DAM 2008 | General Coloring Concept | Natural Superclass | Perfect Graphs |

claim paper

Related Content

» Minimal Universal Bipartite Graphs

» Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted ...

» Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs

» Minimal comparability completions of arbitrary graphs

» Minimal Partitions of a Graph

» Minimal triangulations of graphs A survey

» Minimally nonPfaffian graphs

» A New Algorithm for Finding Minimal CycleBreaking Sets of Turns in a Graph

» Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Arnaud Pêcher, Annegret Wagler

Comments (0)

Sciweavers

On classes of minimal circular-imperfect graphs

DAM 2008 | General Coloring Concept | Natural Superclass | Perfect Graphs |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers