Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2012.09.020 / rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C65 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6236043 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hypergraph coloring | |||
Property / zbMATH Keywords: hypergraph coloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
interval hypergraph | |||
Property / zbMATH Keywords: interval hypergraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
mixed hypergraph | |||
Property / zbMATH Keywords: mixed hypergraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
color-bounded hypergraph | |||
Property / zbMATH Keywords: color-bounded hypergraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
stably bounded hypergraph | |||
Property / zbMATH Keywords: stably bounded hypergraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
chromatic number | |||
Property / zbMATH Keywords: chromatic number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
upper chromatic number | |||
Property / zbMATH Keywords: upper chromatic number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
feasible set | |||
Property / zbMATH Keywords: feasible set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithmic complexity | |||
Property / zbMATH Keywords: algorithmic complexity / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.09.020 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2076597551 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59072528 / rank | |||
Normal rank | |||
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 | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/dm/BujtasT13 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2012.09.020 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:58, 9 December 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
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