Pairs of disjoint dominating sets in connected cubic graphs (Q1926047): 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/s00373-011-1050-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033290650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating theDomatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks about disjoint dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in a graph with a 2‐factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination in connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the domination number of \(n\)-vertex connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination number of cubic graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs of minimum degree at least two and large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairs of disjoint dominating sets and the minimum degree of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Cubic Graphs of Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Stars and the Number Three / rank
 
Normal rank

Latest revision as of 01:09, 6 July 2024

scientific article
Language Label Description Also known as
English
Pairs of disjoint dominating sets in connected cubic graphs
scientific article

    Statements

    Pairs of disjoint dominating sets in connected cubic graphs (English)
    0 references
    0 references
    0 references
    27 December 2012
    0 references
    cubic graphs
    0 references
    domination number
    0 references
    domatic number
    0 references
    inverse domination
    0 references
    disjoint domination number
    0 references
    dominating sets
    0 references

    Identifiers