Nordhaus-Gaddum and other bounds for the chromatic edge-stability number (Q2011157): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126861856, #quickstatements; #temporary_batch_1722284575798
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2019.103042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2982633519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum bounds for total Roman domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite subgraphs of graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum theorem for the distinguishing chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the bipartite edge frustration of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartizing fullerenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bondage numbers of Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic edge stability number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total weight choosability of Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bipartite edge frustration of extension of splice and link graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bipartite edge frustration of graphs under subdivided edges and their related sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite subgraphs of triangle-free subcubic graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126861856 / rank
 
Normal rank

Latest revision as of 21:27, 29 July 2024

scientific article
Language Label Description Also known as
English
Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
scientific article

    Statements

    Nordhaus-Gaddum and other bounds for the chromatic edge-stability number (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 November 2019
    0 references
    distinguishing number
    0 references
    distinguishing chromatic number
    0 references
    Nordhaus-Gaddum theorem
    0 references

    Identifiers