Edge dominating set and colorings on graphs with fixed clique-width (Q1861574): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: NP-completeness of edge-colouring some restricted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508369 / 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: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / 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: Feasible edge colorings of trees with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions and preassignments in preemptive open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results concerning the complexity of restricted colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283244 / 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: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank
 
Normal rank

Revision as of 12:22, 5 June 2024

scientific article
Language Label Description Also known as
English
Edge dominating set and colorings on graphs with fixed clique-width
scientific article

    Statements

    Edge dominating set and colorings on graphs with fixed clique-width (English)
    0 references
    0 references
    0 references
    9 March 2003
    0 references
    dominating set
    0 references
    coloring
    0 references
    edge-dominating set
    0 references
    edge-coloring
    0 references
    polynomial algorithms
    0 references
    clique-width
    0 references

    Identifiers