Partial characterizations of coordinated graphs: Line graphs and complements of forests
DOI10.1007/S00186-008-0257-2zbMATH Open1161.05321OpenAlexW2145081731MaRDI QIDQ1014303FDOQ1014303
Authors: Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro, Flavia Bonomo 
Publication date: 27 April 2009
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-008-0257-2
Recommendations
- Exponential families of minimally non-coordinated graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Coordinated graphs and clique graphs of clique-Helly perfect graphs
- NP-hardness of the recognition of coordinated graphs
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Cites Work
- Algorithmic graph theory and perfect graphs
- The strong perfect graph theorem
- Recognizing Berge graphs
- Kernels in perfect line-graphs
- Title not available (Why is that?)
- Algorithmic aspects of clique-transversal and clique-independent sets
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Line perfect graphs
- Coordinated graphs and clique graphs of clique-Helly perfect graphs
- Exponential families of minimally non-coordinated graphs
- NP-hardness of the recognition of coordinated graphs
- On line perfect graphs
Cited In (6)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- NP-hardness of the recognition of coordinated graphs
- Coordinated graphs and clique graphs of clique-Helly perfect graphs
- Exponential families of minimally non-coordinated graphs
- On some graph classes related to perfect graphs: a survey
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
This page was built for publication: Partial characterizations of coordinated graphs: Line graphs and complements of forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014303)
