Results 71 to 80 of about 1,606 (89)

List Star Edge-Coloring of Subcubic Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
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 chromatic index of G, ch′st(G), be the minimum k such that for any k-uniform ...
Kerdjoudj Samia   +2 more
doaj   +1 more source

The complexity of frugal colouring. [PDF]

open access: yesArab J Math, 2021
Bard S, MacGillivray G, Redlin S.
europepmc   +1 more source

On Generalized Sierpiński Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Rodríguez-Velázquez Juan Alberto   +2 more
doaj   +1 more source

Distinguishing Cartesian Products of Countable Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan   +4 more
doaj   +1 more source

Rainbow Connection Number of Graphs with Diameter 3

open access: yesDiscussiones Mathematicae Graph Theory, 2017
A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj   +1 more source

Distance-based topological polynomials and indices of friendship graphs. [PDF]

open access: yesSpringerplus, 2016
Gao W   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy