Clique-perfectness of complements of line graphs
DOI10.1016/J.ENDM.2011.05.056zbMATH Open1268.05145OpenAlexW2048932473MaRDI QIDQ5891101FDOQ5891101
Authors: Guillermo Durán, Martín D. Safe, Flavia Bonomo, Annegret K. Wagler 
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.056
Recommendations
- Clique-perfectness of complements of line graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Clique-perfectness of claw-free planar graphs
- On clique-transversals and clique-independent sets
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
edge-coloringline graphsminimal forbidden induced subgraphsmaximal matchingsclique-transversal numberclique-perfect graphsclique-independence number
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The NP-Completeness of Edge-Coloring
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Graph minors. I. Excluding a forest
- Distance-hereditary graphs are clique-perfect
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Algorithmic aspects of clique-transversal and clique-independent sets
- 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
- 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
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Cited In (7)
- On clique-perfect and K-perfect graphs
- Title not available (Why is that?)
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- Clique-perfectness of complements of line graphs
- The clique structure of a graph
- Clique-perfectness and balancedness of some graph classes
- On clique-transversals and clique-independent sets
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 Q5891101)
