Maximum number of colors in hypertrees of bounded degree (Q302137): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
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 / zbMATH DE Number | |||
Property / zbMATH DE Number: 6600680 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hypergraph | |||
Property / zbMATH Keywords: hypergraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hypertree | |||
Property / zbMATH Keywords: hypertree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
arboreal hypergraph | |||
Property / zbMATH Keywords: arboreal hypergraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
vertex coloring | |||
Property / zbMATH Keywords: vertex coloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
C-coloring | |||
Property / zbMATH Keywords: C-coloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
upper chromatic number | |||
Property / zbMATH Keywords: upper chromatic number / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59072501 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2094356036 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the minimum size of tight hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper chromatic number of finite projective planes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993087 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum number of colors: C-coloring and related problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On feasible sets of mixed hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring mixed hypergraphs: theory, algorithms and applications / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:04, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum number of colors in hypertrees of bounded degree |
scientific article |
Statements
Maximum number of colors in hypertrees of bounded degree (English)
0 references
4 July 2016
0 references
hypergraph
0 references
hypertree
0 references
arboreal hypergraph
0 references
vertex coloring
0 references
C-coloring
0 references
upper chromatic number
0 references