A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free (Q666001): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2011.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965121071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. I: Orientable prismatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. II: Non-orientable prismatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. III: Circular interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. IV: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. V. Global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameter critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of edges in a minimal graph of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameter 2-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Critical Graphs of Diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Murty and Simon on diameter 2-critical graphs / rank
 
Normal rank

Latest revision as of 00:01, 5 July 2024

scientific article
Language Label Description Also known as
English
A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
scientific article

    Statements

    A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2012
    0 references
    diameter critical
    0 references
    total domination edge critical
    0 references
    claw-free
    0 references

    Identifiers