Color-blind index in graphs of very low degree (Q528569): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Every 8-uniform 8-regular hypergraph is 2-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3630397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can colour-blind distinguish colour palettes? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pólya's permanent problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colour-blind can distinguish colour pallets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Even Cycle Problem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-coloring certain \(k\)-uniform hypergraphs / rank
 
Normal rank

Latest revision as of 20:01, 13 July 2024

scientific article
Language Label Description Also known as
English
Color-blind index in graphs of very low degree
scientific article

    Statements

    Color-blind index in graphs of very low degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    color-blind index
    0 references
    vertex-distinguishing edge-colorings
    0 references
    NP-completeness
    0 references
    2-colorable hypergraphs
    0 references

    Identifiers