When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence

Csilla Bujtás, E. Sampathkumar, Z. Tuza, Charles Dominic, L. Pushpalatha

Research output: Contribution to journalArticle

Abstract

The 3-consecutive vertex coloring number psi;3c(G) of a graph G is the maximum number of colors permitted in a coloring of the vertices of G such that the middle vertex of any path P3 C G has the same color as one of the ends of that P3. This coloring constraint exactly means that no P3 subgraph of G is properly colored in the classical sense. The 3-consecutive edge coloring number psi;3c(G) is the maximum number of colors permitted in a coloring of the edges of G such that the middle edge of any sequence of three edges (in a path P4 or cycle C3) has the same color as one of the other two edges. For graphs G of minimum degree at least 2, denoting by L(G) the line graph of G, we prove that there is a bijection between the 3-consecutive vertex colorings of G and the 3-consecutive edge colorings of L(G), which keeps the number of colors unchanged, too. This implies that psi;3c(G) = psi;3c(L(G)); i.e., the situation is just the opposite of what one would expect for first sight.

Original languageEnglish
Pages (from-to)165-173
Number of pages9
JournalArs Combinatoria
Volume128
Publication statusPublished - Jul 1 2016

Fingerprint

Vertex Coloring
Edge Coloring
Line Graph
Coincidence
Consecutive
Colouring
Graph in graph theory
Path
Minimum Degree
Bijection
Subgraph
Color
Imply
Cycle
Vertex of a graph

Keywords

  • 3-consecutive edge coloring
  • 3-consecutive vertex coloring
  • Line graph
  • Matching
  • Stable k-separator

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Bujtás, C., Sampathkumar, E., Tuza, Z., Dominic, C., & Pushpalatha, L. (2016). When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence. Ars Combinatoria, 128, 165-173.

When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence. / Bujtás, Csilla; Sampathkumar, E.; Tuza, Z.; Dominic, Charles; Pushpalatha, L.

In: Ars Combinatoria, Vol. 128, 01.07.2016, p. 165-173.

Research output: Contribution to journalArticle

Bujtás, C, Sampathkumar, E, Tuza, Z, Dominic, C & Pushpalatha, L 2016, 'When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence', Ars Combinatoria, vol. 128, pp. 165-173.
Bujtás C, Sampathkumar E, Tuza Z, Dominic C, Pushpalatha L. When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence. Ars Combinatoria. 2016 Jul 1;128:165-173.
Bujtás, Csilla ; Sampathkumar, E. ; Tuza, Z. ; Dominic, Charles ; Pushpalatha, L. / When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence. In: Ars Combinatoria. 2016 ; Vol. 128. pp. 165-173.
@article{c002f3e6b3ac43419310c45e31c69253,
title = "When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence",
abstract = "The 3-consecutive vertex coloring number psi;3c(G) of a graph G is the maximum number of colors permitted in a coloring of the vertices of G such that the middle vertex of any path P3 C G has the same color as one of the ends of that P3. This coloring constraint exactly means that no P3 subgraph of G is properly colored in the classical sense. The 3-consecutive edge coloring number psi;3c(G) is the maximum number of colors permitted in a coloring of the edges of G such that the middle edge of any sequence of three edges (in a path P4 or cycle C3) has the same color as one of the other two edges. For graphs G of minimum degree at least 2, denoting by L(G) the line graph of G, we prove that there is a bijection between the 3-consecutive vertex colorings of G and the 3-consecutive edge colorings of L(G), which keeps the number of colors unchanged, too. This implies that psi;3c(G) = psi;3c(L(G)); i.e., the situation is just the opposite of what one would expect for first sight.",
keywords = "3-consecutive edge coloring, 3-consecutive vertex coloring, Line graph, Matching, Stable k-separator",
author = "Csilla Bujt{\'a}s and E. Sampathkumar and Z. Tuza and Charles Dominic and L. Pushpalatha",
year = "2016",
month = "7",
day = "1",
language = "English",
volume = "128",
pages = "165--173",
journal = "Ars Combinatoria",
issn = "0381-7032",
publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence

AU - Bujtás, Csilla

AU - Sampathkumar, E.

AU - Tuza, Z.

AU - Dominic, Charles

AU - Pushpalatha, L.

PY - 2016/7/1

Y1 - 2016/7/1

N2 - The 3-consecutive vertex coloring number psi;3c(G) of a graph G is the maximum number of colors permitted in a coloring of the vertices of G such that the middle vertex of any path P3 C G has the same color as one of the ends of that P3. This coloring constraint exactly means that no P3 subgraph of G is properly colored in the classical sense. The 3-consecutive edge coloring number psi;3c(G) is the maximum number of colors permitted in a coloring of the edges of G such that the middle edge of any sequence of three edges (in a path P4 or cycle C3) has the same color as one of the other two edges. For graphs G of minimum degree at least 2, denoting by L(G) the line graph of G, we prove that there is a bijection between the 3-consecutive vertex colorings of G and the 3-consecutive edge colorings of L(G), which keeps the number of colors unchanged, too. This implies that psi;3c(G) = psi;3c(L(G)); i.e., the situation is just the opposite of what one would expect for first sight.

AB - The 3-consecutive vertex coloring number psi;3c(G) of a graph G is the maximum number of colors permitted in a coloring of the vertices of G such that the middle vertex of any path P3 C G has the same color as one of the ends of that P3. This coloring constraint exactly means that no P3 subgraph of G is properly colored in the classical sense. The 3-consecutive edge coloring number psi;3c(G) is the maximum number of colors permitted in a coloring of the edges of G such that the middle edge of any sequence of three edges (in a path P4 or cycle C3) has the same color as one of the other two edges. For graphs G of minimum degree at least 2, denoting by L(G) the line graph of G, we prove that there is a bijection between the 3-consecutive vertex colorings of G and the 3-consecutive edge colorings of L(G), which keeps the number of colors unchanged, too. This implies that psi;3c(G) = psi;3c(L(G)); i.e., the situation is just the opposite of what one would expect for first sight.

KW - 3-consecutive edge coloring

KW - 3-consecutive vertex coloring

KW - Line graph

KW - Matching

KW - Stable k-separator

UR - http://www.scopus.com/inward/record.url?scp=85031325340&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85031325340&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85031325340

VL - 128

SP - 165

EP - 173

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -