On interval colourings of bi-regular bipartite graphs (Q2713634)
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: On interval colourings of bi-regular bipartite graphs |
scientific article; zbMATH DE number 1602764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On interval colourings of bi-regular bipartite graphs |
scientific article; zbMATH DE number 1602764 |
Statements
10 June 2001
0 references
bipartite graph
0 references
edge colouring
0 references
interval colouring
0 references
0.9506268
0 references
0.94836545
0 references
0.94754267
0 references
0.9415899
0 references
0.9406243
0 references
0.93202573
0 references
0.92979455
0 references
On interval colourings of bi-regular bipartite graphs (English)
0 references
An edge coloring of a graph which uses integers as colors is called an interval coloring if for any vertex, the colors used on the edges incident with this vertex form an interval. It is an open question if every biregular bipartite graph allows an interval coloring. This conjecture is proved here for the case of \((2,d)\)-regular bipartite graphs (i.e., all vertices in one class of the bipartition have degree 2 and all vertices in the other class have degree \(d\)), for any odd \(d\). For even \(d\), the result follows from the Petersen theorem and was previously known.
0 references
