Clique-perfectness of complements of line graphs
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Recommendations
Cites work
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic Aspects of Neighborhood Numbers
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Algorithms for finding clique-transversals of graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Blocking and anti-blocking pairs of polyhedra
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Clique-perfectness of complements of line graphs
- Colouring the petals of a graph
- Covering the cliques of a graph with vertices
- Depth-First Search and Linear Graph Algorithms
- Distance-hereditary graphs are clique-perfect
- Dually Chordal Graphs
- Edge-Coloring Partialk-Trees
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graph theory
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- scientific article; zbMATH DE number 3363617 (Why is no real title available?)
- Kernels in perfect line-graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Neighborhood perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- On clique-complete graphs
- On clique-transversals and clique-independent sets
- On linear and circular structure of (claw, net)-free graphs
- On Representatives of Subsets
- On small graphs critical with respect to edge colourings
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Recognizing Berge graphs
- The chromatic index of a graph whose core has maximum degree two
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The NP-Completeness of Edge-Coloring
- The number of caterpillars
- The strong perfect graph theorem
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Trees with Hamiltonian square
Cited in
(9)- On some graph classes related to perfect graphs: a survey
- The clique-perfectness and clique-coloring of outer-planar graphs
- On perfect matchings of complements of line graphs
- Clique-perfectness of claw-free planar graphs
- Spanning Eulerian subdigraphs in jump digraphs
- Clique-perfectness of complements of line graphs
- Upper Clique Transversals in Graphs
- Conformality of minimal transversals of maximal cliques
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
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)
