Complete colourings of hypergraphs (Q2279996): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127181455, #quickstatements; #temporary_batch_1722243545156
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Keith J. Edwards / rank
Normal rank
 
Property / author
 
Property / author: Paweł Rzążewski / rank
Normal rank
 
Property / author
 
Property / author: Keith J. Edwards / rank
 
Normal rank
Property / author
 
Property / author: Paweł Rzążewski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2974959228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achromatic number is NP-complete for cographs and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The achromatic number of bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonious and achromatic colorings of fragmentable hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Harmonious Chromatic Number of Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achromatic number of fragmentable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonious chromatic number of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of harmonious colouring for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concerning the achromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colour-critical graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncolorable mixed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083463 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127181455 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:05, 29 July 2024

scientific article
Language Label Description Also known as
English
Complete colourings of hypergraphs
scientific article

    Statements

    Complete colourings of hypergraphs (English)
    0 references
    17 December 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    complete colouring
    0 references
    achromatic number
    0 references
    hypergraph
    0 references
    strong colouring
    0 references
    0 references
    0 references
    0 references
    0 references