ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Martin Charles Golumbic / rank
Normal rank
 
Property / author
 
Property / author: Udi Rotics / rank
Normal rank
 
Property / author
 
Property / author: Martin Charles Golumbic / rank
 
Normal rank
Property / author
 
Property / author: Udi Rotics / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted unimodular chordal graphs / rank
 
Normal rank

Latest revision as of 00:17, 10 July 2024

scientific article; zbMATH DE number 6432051
Language Label Description Also known as
English
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
scientific article; zbMATH DE number 6432051

    Statements

    Identifiers