Clique-perfectness of complements of line graphs
DOI10.1016/J.DAM.2015.01.012zbMATH Open1311.05145OpenAlexW2174987007MaRDI QIDQ5919747FDOQ5919747
Authors: Flavia Bonomo, Guillermo Durán, Martín D. Safe, Annegret K. Wagler 
Publication date: 22 May 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.012
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Graph theory
- Normal hypergraphs and the perfect graph conjecture
- Depth-First Search and Linear Graph Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Graph structure and monadic second-order logic. A language-theoretic approach
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- Trees with Hamiltonian square
- The strong perfect graph theorem
- Recognizing Berge graphs
- Graph minors. II. Algorithmic aspects of tree-width
- On Representatives of Subsets
- Kernels in perfect line-graphs
- The number of caterpillars
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Dually Chordal Graphs
- Blocking and anti-blocking pairs of polyhedra
- Graph minors. I. Excluding a forest
- Distance-hereditary graphs are clique-perfect
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Covering the cliques of a graph with vertices
- On small graphs critical with respect to edge colourings
- On clique-transversals and clique-independent sets
- Algorithmic aspects of clique-transversal and clique-independent sets
- Edge-Coloring Partialk-Trees
- Algorithmic Aspects of Neighborhood Numbers
- Algorithms for finding clique-transversals of graphs
- The chromatic index of a graph whose core has maximum degree two
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- On clique-complete graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Colouring the petals of a graph
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- On linear and circular structure of (claw, net)-free graphs
- Neighborhood perfect graphs
- Clique-perfectness of complements of line graphs
Cited In (7)
- The clique-perfectness and clique-coloring of outer-planar graphs
- Clique-perfectness of claw-free planar graphs
- On some graph classes related to perfect graphs: a survey
- Spanning Eulerian subdigraphs in jump digraphs
- Upper Clique Transversals in Graphs
- Clique-perfectness of complements of line graphs
- On perfect matchings of complements of line graphs
This page was built for publication: Clique-perfectness of complements of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919747)
