Results 71 to 80 of about 808 (83)

Kaleidoscopic Colorings of Graphs

Discussiones Mathematicae Graph Theory, 2017
For an r-regular graph G, let c : E(G) → [k] = {1, 2, . . . , k}, k ≥ 3, be an edge coloring of G, where every vertex of G is incident with at least one edge of each color.
Chartrand Gary, English Sean, Zhang Ping
doaj   +1 more source

𝒫-Apex Graphs

Discussiones Mathematicae Graph Theory, 2018
Let 𝒫 be an arbitrary class of graphs that is closed under taking induced subgraphs and let 𝒞 (𝒫) be the family of forbidden subgraphs for 𝒫. We investigate the class 𝒫 (k) consisting of all the graphs G for which the removal of no more than k vertices ...
Borowiecki Mieczysław, Drgas-Burchardt Ewa, Sidorowicz Elżbieta   +2 more
doaj   +1 more source

The {−2,−1}-Selfdual and Decomposable Tournaments

Discussiones Mathematicae Graph Theory, 2018
We only consider finite tournaments. The dual of a tournament is obtained by reversing all the arcs. A tournament is selfdual if it is isomorphic to its dual.
Boudabbous Youssef, Ille Pierre
doaj   +1 more source

Gromov hyperbolicity of planar graphs

Open Mathematics, 2013
Cantón Alicia, Granados Ana, Pestana Domingo, Rodríguez José   +3 more
doaj   +1 more source

A pilot study evaluating non-contact low-frequency ultrasound and underlying molecular mechanism on diabetic foot ulcers. [PDF]

Int Wound J, 2014
Yao M, Hasturk H, Kantarci A, Gu G, Garcia-Lavin S, Fabbi M, Park N, Hayashi H, Attala K, French MA, Driver VR.   +10 more
europepmc   +1 more source

Further Exploration of an Upper Bound for Kemeny's Constant. [PDF]

Entropy (Basel)
Kooij RE, Dubbeldam JLA.
europepmc   +1 more source

Non-hyperbolicity in random regular graphs and their traffic characteristics

Open Mathematics, 2013
Tucci Gabriel
doaj   +1 more source

Bipartite S₂ graphs are Cohen-Macaulay [PDF]

, 2010
Haghighi, H., Yassemi, S., Zaare-Nahandi, R.   +2 more
core   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On b-Coloring Parameters of Some Classes of Graphs

, 2019
Vertex coloring has always been a topic of interest. Motivated by the studies on -chromatic mean and variance of some standard graphs, in this paper, we obtain few results for -chromatic and -chromatic mean and variance of some cycle related graph ...
M. R. Raksha, P. Hithavarshini, N. Sudev, C. Dominic   +3 more
semanticscholar   +1 more source

Structural theorem in 3-polytopes with minimum degree five

, 2016
A vertex of degree i is called i-vertex. An i-vertex in a plane graph is called i(k∆)-vertex if it is incident with exactly k faces of size three. An edge uv is an edge of type (i(k∆), j) if u is an i(k∆)-vertex and v is a j-vertex.
J. Bucko, J. Czap
semanticscholar   +1 more source