On the Structure of Graphs Vertex Critical with Respect to Connected Domination (Q2971614): 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/978-3-540-76796-1_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W272153672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-factor-criticality in domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results related to the toughness of 3-domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in 3-vertex-critical graphs: the odd case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in 3‐vertex‐critical graphs: The even case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895508 / 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: On k-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected domination critical graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some recent results on domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / 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: Some inequalities about connected domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching properties in domination critical graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of total domination vertex critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching properties in connected domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q3340900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2839672 / rank
 
Normal rank

Latest revision as of 15:20, 13 July 2024

scientific article
Language Label Description Also known as
English
On the Structure of Graphs Vertex Critical with Respect to Connected Domination
scientific article

    Statements

    On the Structure of Graphs Vertex Critical with Respect to Connected Domination (English)
    0 references
    0 references
    7 April 2017
    0 references

    Identifiers