A technique for multicoloring triangle-free hexagonal graphs (Q2570123): 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.2005.06.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064369194 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding a five bicolouring of a triangle-free subgraph of the triangular lattice / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Channel assignment and weighted coloring / rank | |||
Normal rank | |||
Latest revision as of 17:58, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A technique for multicoloring triangle-free hexagonal graphs |
scientific article |
Statements
A technique for multicoloring triangle-free hexagonal graphs (English)
0 references
26 October 2005
0 references
Hexagonal graphs
0 references
Multicoloring triangular lattice
0 references
Triangle-free
0 references
