Independent domination in finitely defined classes of graphs (Q1399990): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nice class for the vertex packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination problems for permutation and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc 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: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semi-\(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted parameters in \((P_5,\overline {P_5})\)-free graphs / 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: Some classes of perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination on Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite graphs without a skew star / 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: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank

Latest revision as of 17:56, 5 June 2024

scientific article
Language Label Description Also known as
English
Independent domination in finitely defined classes of graphs
scientific article

    Statements

    Independent domination in finitely defined classes of graphs (English)
    0 references
    0 references
    0 references
    30 July 2003
    0 references
    Graph
    0 references
    independent dominating set
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers