When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence. (Q2829074)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence. |
scientific article; zbMATH DE number 6644265
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence. |
scientific article; zbMATH DE number 6644265 |
Statements
26 October 2016
0 references
\(3\)-consecutive vertex coloring
0 references
\(3\)-consecutive edge coloring
0 references
line graph
0 references
matching
0 references
stable \(k\)-separator
0 references
When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence. (English)
0 references
