Traceability of connected domination critical graphs (Q2656675): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On domination critical graphs with cutvertices having connected domination number 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5413909 / 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: Connected domination critical graphs. / 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: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the connected domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected domination of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and hamiltonicity in 3-domination-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of 3-domination-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on the approximability of the maximum leaves spanning tree problem / 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: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3004156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4604123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4568192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected domination number of a graph and its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable connected domination for restricted bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum number of edges in connected graphs with a given domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of domination-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some 3‐connected 4‐edge‐critical non‐Hamiltonian graphs / rank
 
Normal rank

Latest revision as of 19:40, 24 July 2024

scientific article
Language Label Description Also known as
English
Traceability of connected domination critical graphs
scientific article

    Statements

    Traceability of connected domination critical graphs (English)
    0 references
    0 references
    0 references
    16 March 2021
    0 references
    domination
    0 references
    connected domination critical
    0 references
    Hamiltonicity
    0 references
    traceability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references