Results 21 to 30 of about 10,769 (289)
On the inclusion chromatic index of a graph [PDF]
Journal of Graph Theory, 2020 AbstractLet be the least number of colours necessary to properly colour the edges of a graph with minimum degree so that the set of colours incident with any vertex is not contained in a set of colours incident to any of its neighbours. We provide an infinite family of examples of graphs with , where is the maximum degree of , and we conjecture ...
Jakub Przybylo, Jakub Kwasny
openaire +1 more source
Graph coloring with inversion in the Γ1 non-deranged permutations
UMYU Scientifica Journal, 2022 In this paper, we investigate graph coloring with inversion in non-deranged permutations, the permutation which fixes the first element in the permutations. This was first accomplished by performing some calculations on this strategy using prime numbers.
Ibrahim Muhammad, Olalekan Aremu Kazeem
doaj +1 more source
The chromatic index of strongly regular graphs [PDF]
, 2021 We determine (partly by computer search) the chromatic index (edge-chromatic number) of many strongly regular graphs (SRGs), including the SRGs of degree k ≤ 18 and their complements, the Latin square graphs and their complements, and the triangular ...
Guo, K.; id_orcid +6 more
core +1 more source
On the edge chromatic vertex stability number of graphs
AKCE International Journal of Graphs and Combinatorics, 2023 For an arbitrary invariant [Formula: see text] of a graph G, the [Formula: see text]vertex stability number [Formula: see text] is the minimum number of vertices of G whose removal results in a graph [Formula: see text] with [Formula: see text] or with ...
Saeid Alikhani, Mohammad R. Piri
doaj +1 more source
Approximating the chromatic index of multigraphs [PDF]
Journal of Combinatorial Optimization, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zang, W, Chen, G, Yu, X
openaire +4 more sources
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
doaj +1 more source
Strong Chromatic Index of Outerplanar Graphs
Axioms, 2022 The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +1 more source
Acyclic Chromatic Index of 1-Planar Graphs
Mathematics, 2022 The acyclic chromatic index χa′(G) of a graph G is the smallest k for which G is a proper edge colorable using k colors. A 1-planar graph is a graph that can be drawn in plane such that every edge is crossed by at most one other edge.
Wanshun Yang +5 more
doaj +1 more source
Mixed Graph Colorings: A Historical Review
Mathematics, 2020 This paper presents a historical review and recent developments in mixed graph colorings in the light of scheduling problems with the makespan criterion. A mixed graph contains both a set of arcs and a set of edges. Two types of colorings of the vertices
Yuri N. Sotskov
doaj +1 more source
On the ρ-Edge Stability Number of Graphs
Discussiones Mathematicae Graph Theory, 2022 For an arbitrary invariant ρ(G) of a graph G the ρ-edge stability number esρ(G) is the minimum number of edges of G whose removal results in a graph H ⊆ G with ρ(H) ≠ ρ(G) or with E(H) = ∅.
Kemnitz Arnfried, Marangio Massimiliano
doaj +1 more source