Trees in greedy colorings of hypergraphs (Q616002): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2010.10.017 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2010491244 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring H-free hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Induced subtrees in graphs of large chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on embedding hypertrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4276003 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Greedy colorings of uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3932997 / rank | |||
Normal rank |
Latest revision as of 15:37, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Trees in greedy colorings of hypergraphs |
scientific article |
Statements
Trees in greedy colorings of hypergraphs (English)
0 references
7 January 2011
0 references
greedy coloring
0 references
chromatic number
0 references
subtrees in graphs
0 references