Results 71 to 80 of about 269 (132)
On Nordhaus-Gaddum type relations of δ-complement graphs. [PDF]
Heliyon, 2023 Vichitkunakorn P +2 more
europepmc +1 more source
Conflict-free coloring of graphs
, 2013 We study the conflict-free chromatic number χCF of graphs from ex-tremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number an n-vertex graph can have. Our construction is randomized.
Tibor Szabó +2 more
core
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 +1 more
doaj +1 more source
Further results on monotonic graph invariants and bipartiteness number
, 2019 The bipartiteness of a graph is the minimum number of vertices whose deletion from G results in a bipartite graph. If a graph invariant decreases or increases with addition of edges of its complement, then it is called a monotonic graph invariant.
Liu, Jia-Bao, Chen, Hanlin
core
Facial Incidence Colorings of Embedded Multigraphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a cellular embedding of a multigraph in a 2-manifold. Two distinct edges e1, e2 ∈ E(G) are facially adjacent if they are consecutive on a facial walk of a face f ∈ F(G). An incidence of the multigraph G is a pair (v, e), where v ∈ V (G), e ∈ E(G)
Jendrol’ Stanislav +2 more
doaj +1 more source
Group magicness of complete n-partite graphs
, 2008 Let A be a non-trivial Abelian group. We call a graph G = (V, E) A-magic if there exists a labeling f: E → A ∗ such that the induced vertex set labeling f +: V → A, defined by f + (v) = uv∈E f(uv) is a constant map. In this paper, we show that Kk1,k2,.
Richard M. Low, W. C. Shiu
core
Tr-Span of Directed Wheel Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are ...
Besson Marc, Tesman Barry
doaj +1 more source
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
, 2007 A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo +3 more
core
List Star Edge-Coloring of Subcubic Graphs
Discussiones 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
Application of maple on computing strong fuzzy chromatic polynomial of fuzzy graphs. [PDF]
BMC Res Notes, 2022 Ashebo MA, Rathour L, Repalle VNS.
europepmc +1 more source