Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)
DW Cranston - arXiv preprint arXiv:2210.05915, 2022 - arxiv.org
arXiv:2210.05915v2 [math.CO] 22 Apr 2023 Page 1 arXiv:2210.05915v2 [math.CO] 22 Apr
2023 Coloring, List Coloring, and Painting Squares of Graphs (and other related problems) …
2023 Coloring, List Coloring, and Painting Squares of Graphs (and other related problems) …
Strong chromatic index of graphs with maximum degree four
M Huang, M Santana, G Yu - arXiv preprint arXiv:1806.07012, 2018 - arxiv.org
A strong edge-coloring of a graph $ G $ is a coloring of the edges such that every color class
induces a matching in $ G $. The strong chromatic index of a graph is the minimum number …
induces a matching in $ G $. The strong chromatic index of a graph is the minimum number …
The chromatic number of the square of subcubic planar graphs
SG Hartke, S Jahanbekam, B Thomas - arXiv preprint arXiv:1604.06504, 2016 - arxiv.org
arXiv:1604.06504v1 [math.CO] 21 Apr 2016 Page 1 arXiv:1604.06504v1 [math.CO] 21 Apr
2016 The chromatic number of the square of subcubic planar graphs Stephen G. Hartke∗ …
2016 The chromatic number of the square of subcubic planar graphs Stephen G. Hartke∗ …
[HTML][HTML] Strong edge-coloring of planar graphs
A strong edge-coloring of a graph is a proper edge-coloring where the edges at distance at
most 2 receive distinct colors. It is known that every planar graph G has a strong edge …
most 2 receive distinct colors. It is known that every planar graph G has a strong edge …
Recent progress on strong edge-coloring of graphs
K Deng, G Yu, X Zhou - Discrete Mathematics, Algorithms and …, 2019 - World Scientific
Recent progress on strong edge-coloring of graphs Page 1 Discrete Mathematics, Algorithms
and Applications Vol. 11, No. 5 (2019) 1950062 (21 pages) c© World Scientific Publishing …
and Applications Vol. 11, No. 5 (2019) 1950062 (21 pages) c© World Scientific Publishing …
[HTML][HTML] Strong chromatic index of subcubic planar multigraphs
AV Kostochka, X Li, W Ruksasakchai… - European Journal of …, 2016 - Elsevier
The strong chromatic index of a multigraph is the minimum k such that the edge set can be k-
colored requiring that each color class induces a matching. We verify a conjecture of …
colored requiring that each color class induces a matching. We verify a conjecture of …
[HTML][HTML] Strong edge-colouring of sparse planar graphs
A strong edge-colouring of a graph is a proper edge-colouring where each colour class
induces a matching. It is known that every planar graph with maximum degree Δ has a …
induces a matching. It is known that every planar graph with maximum degree Δ has a …
[PDF][PDF] List star edge-coloring of subcubic graphs
S Kerdjoudj, A Kostochka… - Discussiones …, 2018 - bibliotekanauki.pl
A star edge-coloring of a graph G is a proper edge coloring such that every 2-colored
connected subgraph of G is a path of length at most 3. For a graph G, let the list star …
connected subgraph of G is a path of length at most 3. For a graph G, let the list star …
On S-packing edge-colorings of cubic graphs
N Gastineau, O Togni - Discrete Applied Mathematics, 2019 - Elsevier
Given a non-decreasing sequence S=(s 1, s 2,…, sk) of positive integers, an S-packing edge-
coloring of a graph G is a partition of the edge set of G into k subsets {X 1, X 2,…, X k} such …
coloring of a graph G is a partition of the edge set of G into k subsets {X 1, X 2,…, X k} such …
Injective edge-coloring of subcubic graphs
B Ferdjallah, S Kerdjoudj, A Raspaud - … Algorithms and Applications, 2022 - World Scientific
An injective edge-coloring c of a graph G is an edge-coloring such that if e 1, e 2, and e 3
are three consecutive edges in G (they are consecutive if they form a path or a cycle of …
are three consecutive edges in G (they are consecutive if they form a path or a cycle of …