Upper bounds on the diameter of domination dot-critical graphs with given connectivity (Q2444534): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.dam.2013.05.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043323011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination dot-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination dot-critical graphs with no critical vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex domination‐critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound on the diameter of a domination dot-critical graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of dot-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of a domination dot-critical graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:04, 7 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds on the diameter of domination dot-critical graphs with given connectivity
scientific article

    Statements

    Upper bounds on the diameter of domination dot-critical graphs with given connectivity (English)
    0 references
    0 references
    10 April 2014
    0 references
    dot-critical graph
    0 references
    diameter
    0 references
    connectivity
    0 references

    Identifiers