Results 11 to 20 of about 14,669 (262)

Maximum Edge-Colorings Of Graphs

Discussiones Mathematicae Graph Theory, 2016
An r-maximum k-edge-coloring of G is a k-edge-coloring of G having a property that for every vertex v of degree dG(v) = d, d ≥ r, the maximum color, that is present at vertex v, occurs at v exactly r times. The r-maximum index χr′(G)$\chi _r^\prime (G)$
Jendrol’ Stanislav, Vrbjarová Michaela   +1 more
doaj   +2 more sources

Antipodal Edge-Colorings of Hypercubes

Discussiones Mathematicae Graph Theory, 2019
Two vertices of the k-dimensional hypercube Qkare antipodal if they differ in every coordinate. Edges uv and xy are antipodal if u is antipodal to x and v is antipodal to y.
West Douglas B., Wise Jennifer I.
doaj   +2 more sources

From Edge-Coloring to Strong Edge-Coloring [PDF]

The Electronic Journal of Combinatorics, 2015
In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: $k$-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian. In this coloring, the set $S(v)$ of colors used by edges incident to a vertex $v$ does not intersect $S(u)$ on more than $k$ colors when $u$ and $v$ are adjacent.
Borozan, Valentin, Chang, Gerard Jennhwa, Cohen, Nathann, Fujita, Shinya, Narayanan, Narayanan, Naserasr, Reza, Valicov, Petru   +6 more
openaire   +3 more sources

Edge-Coloring Bipartite Graphs [PDF]

Journal of Algorithms, 2000
This note provides an algorithm for finding \(\Delta\)(colors)-edge-coloring of a bipartite graph of order \(n\) and size \(m\) in time \(T+O(m\log \Delta)\) where \(T\) is the time needed to find a perfect matching in a \(k\)-regular bipartite graph, \(k\leq \Delta\), and \(\Delta\) is the maximum degree of vertices.
A. Kapoor, Rizzi, Romeo
openaire   +3 more sources

Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs [PDF]

Graphs and Combinatorics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Ruonan, Broersma, Hajo, Zhang, Shenggui   +2 more
openaire   +2 more sources

Approximate constrained bipartite edge coloring [PDF]

Discrete Applied Mathematics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Persiano, Pino, Rivano, Hervé   +5 more
openaire   +4 more sources

Edge coloring signed graphs [PDF]

Discrete Mathematics, 2020
We define a method for edge coloring signed graphs and what it means for such a coloring to be proper. Our method has many desirable properties: it specializes to the usual notion of edge coloring when the signed graph is all-negative, it has a natural definition in terms of vertex coloring of a line graph, and the minimum number of colors required for
openaire   +2 more sources

Balanced edge colorings

Journal of Combinatorial Theory, Series B, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Balister, P.N., Kostochka, A., Li, Hao, Schelp, R.H.   +3 more
openaire   +2 more sources

Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs [PDF]

Journal of Graph Theory, 2019
AbstractIt is conjectured that every edge‐colored complete graph on vertices satisfying contains vertex‐disjoint properly edge‐colored cycles. We confirm this conjecture for , prove several additional weaker results for general , and we establish structural properties of possible minimum counterexamples to the conjecture.
Ruonan Li, Hajo Broersma, Shenggui Zhang
openaire   +3 more sources

AVD edge-colorings of cubic Halin graphs

AIMS Mathematics, 2023
The adjacent vertex-distinguishing edge-coloring of a graph $ G $ is a proper edge-coloring of $ G $ such that each pair of adjacent vetices receives a distinct set of colors.
Ningge Huang , Lily Chen
doaj   +1 more source