Spanning trees with disjoint dominating and 2-dominating sets (Q2062688): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q126793916, #quickstatements; #temporary_batch_1719442853500
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3145697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graphs with diameter-preserving spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3451017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning the Vertices of a Graph into Two Total Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning the vertices of a cubic graph into two total dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks about disjoint dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with disjoint dominating and 2-dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning trees with restricted degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree-preserving spanning tree problem in strongly chordal and directed path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter-preserving spanning trees in sparse weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint dominating and 2-dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners of bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with disjoint dominating and paired-dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating and total dominating partitions in cubic graphs / rank
 
Normal rank

Revision as of 14:40, 27 July 2024

scientific article
Language Label Description Also known as
English
Spanning trees with disjoint dominating and 2-dominating sets
scientific article

    Statements

    Spanning trees with disjoint dominating and 2-dominating sets (English)
    0 references
    0 references
    0 references
    3 January 2022
    0 references
    domination
    0 references
    2-domination
    0 references
    spanning tree
    0 references

    Identifiers