Coloring chip configurations on graphs and digraphs (Q763476): 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 / OpenAlex ID | |||
| Property / OpenAlex ID: W2001557718 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree constrained subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Weight choosability of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lucky labelings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3999001 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge weights and vertex colours / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3575472 / rank | |||
Normal rank | |||
Latest revision as of 00:21, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring chip configurations on graphs and digraphs |
scientific article |
Statements
Coloring chip configurations on graphs and digraphs (English)
0 references
9 March 2012
0 references
combinatorial problems
0 references
graph algorithms
0 references
graph coloring
0 references
chip arrangement
0 references
chip shifting operation
0 references
digraph coloring
0 references
