Nordhaus-Gaddum for treewidth (Q412239): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus–Gaddum‐type Theorems for decompositions into many parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hajós number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique minors in graphs and their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hadwiger's number---A problem of the Nordhaus-Gaddum type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750883 / rank
 
Normal rank

Latest revision as of 04:00, 5 July 2024

scientific article
Language Label Description Also known as
English
Nordhaus-Gaddum for treewidth
scientific article

    Statements

    Identifiers

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