2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s10878-014-9783-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071183009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4351076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some inequalities about connected domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Domination and Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-connected graphs with small 2-connected dominating sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-domination and \(k\)-independence in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation graphs: Connected domination and Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected dominating set. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hadwiger's Number and the Stability Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter approximation bounds for minimum CDS in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for minimum 2-connected \(r\)-hop dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly chordal graphs, steiner trees, and connected domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, connected domination and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum connected dominating sets and maximal independent sets in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless networking, dominating and packing / rank
 
Normal rank

Latest revision as of 11:02, 11 July 2024

scientific article; zbMATH DE number 6544334
Language Label Description Also known as
English
2-edge connected dominating sets and 2-connected dominating sets of a graph
scientific article; zbMATH DE number 6544334

    Statements

    2-edge connected dominating sets and 2-connected dominating sets of a graph (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2016
    0 references
    connected dominating set
    0 references
    dominating set
    0 references
    independent set
    0 references

    Identifiers