Results 1 to 10 of about 208 (79)
Coverings of Cubic Graphs and 3-Edge Colorability
Discussiones Mathematicae Graph Theory, 2021 Let h:G˜→Gh:\tilde G \to G be a finite covering of 2-connected cubic (multi)graphs where G is 3-edge uncolorable. In this paper, we describe conditions under which G˜\tilde G is 3-edge uncolorable. As particular cases, we have constructed regular and
Plachta Leonid
doaj +1 more source
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
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
Discussiones Mathematicae Graph Theory, 2021 An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E → {1, . . ., |E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = Σf(e), with e ranging ...
Lau Gee-Choon, Shiu Wai-Chee, Ng Ho-Kuen
doaj +1 more source
Coloring subgraphs with restricted amounts of hues
Open Mathematics, 2017 We consider vertex colorings where the number of colors given to specified subgraphs is restricted. In particular, given some fixed graph F and some fixed set A of positive integers, we consider (not necessarily proper) colorings of the vertices of a ...
Goddard Wayne, Melville Robert
doaj +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao +2 more
doaj +1 more source
2-Distance Colorings of Integer Distance Graphs
Discussiones Mathematicae Graph Theory, 2019 A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. . ., k} such that every two vertices at distance at most 2 receive distinct colors.
Benmedjdoub Brahim +2 more
doaj +1 more source
Facial Rainbow Coloring of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +1 more source
Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
Discussiones Mathematicae Graph Theory, 2019 An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph.
Dybizbański Janusz, Nenca Anna
doaj +1 more source
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
Discussiones Mathematicae Graph Theory, 2020 A graph G is edge k-choosable (respectively, total k-choosable) if, whenever we are given a list L(x) of colors with |L(x)| = k for each x ∈ E(G) (x ∈ E(G) ∪ V (G)), we can choose a color from L(x) for each element x such that no two adjacent (or ...
Sun Lin +3 more
doaj +1 more source