Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59072528, #quickstatements; #temporary_batch_1712201099914
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4411274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-bounded hypergraphs. I: General results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3649378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-bounded hypergraphs, IV: Stable colorings of hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-bounded hypergraphs, V: host graphs and subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed interval hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic polynomials of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5297357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of edge-coloring in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight approximations for resource constrained scheduling and bin packing / 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: Coloring mixed hypergraphs: theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Comparability Graph of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on "The Comparability Graph of a Tree" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Coloring and f-Coloring for Various Classes of Graphs / rank
 
Normal rank

Revision as of 02:54, 7 July 2024

scientific article
Language Label Description Also known as
English
Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
scientific article

    Statements

    Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (English)
    0 references
    0 references
    0 references
    6 December 2013
    0 references
    hypergraph coloring
    0 references
    interval hypergraph
    0 references
    mixed hypergraph
    0 references
    color-bounded hypergraph
    0 references
    stably bounded hypergraph
    0 references
    chromatic number
    0 references
    upper chromatic number
    0 references
    feasible set
    0 references
    algorithmic complexity
    0 references

    Identifiers

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