Clique-perfectness of complements of line graphs (Q5891101): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Flavia Bonomo-Braberman / rank
Normal rank
 
Property / author
 
Property / author: Annegret K. Wagler / rank
Normal rank
 
Property / author
 
Property / author: Flavia Bonomo-Braberman / rank
 
Normal rank
Property / author
 
Property / author: Annegret K. Wagler / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2011.05.056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048932473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring the petals of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of clique-transversal and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of a graph whose core has maximum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs are clique-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank

Latest revision as of 16:27, 6 July 2024

scientific article; zbMATH DE number 6190264
Language Label Description Also known as
English
Clique-perfectness of complements of line graphs
scientific article; zbMATH DE number 6190264

    Statements

    Clique-perfectness of complements of line graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 July 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    clique-transversal number
    0 references
    clique-independence number
    0 references
    clique-perfect graphs
    0 references
    edge-coloring
    0 references
    line graphs
    0 references
    maximal matchings
    0 references
    minimal forbidden induced subgraphs
    0 references
    0 references