Results 71 to 80 of about 1,105 (90)

Rainbow Vertex-Connection and Forbidden Subgraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj   +1 more source

A Note on the Interval Function of a Disconnected Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2018
In this note we extend the Mulder-Nebeský characterization of the interval function of a connected graph to the disconnected case. One axiom needs to be adapted, but also a new axiom is needed in addition.
Changat Manoj   +3 more
doaj   +1 more source

On Radio Connection Number of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
Given a graph G and a vertex coloring c, G is called l-radio connected if between any two distinct vertices u and v there is a path such that coloring c restricted to that path is an l-radio coloring.
Marinescu-Ghemeci Ruxandra
doaj   +1 more source

Threshold functions for asymmetric Ramsey properties involving cycles

open access: yesRandom Struct. Algorithms, 1997
Y. Kohayakawa, Bernd Kreuter
semanticscholar   +1 more source

New upper bounds on the order of cages

open access: yesElectronic Journal of Combinatorics, 1996
F. Lazebnik, V. Ustimenko, A. Woldar
semanticscholar   +1 more source

On the length of arcs in labyrinth fractals. [PDF]

open access: yesMon Hefte Math, 2018
Cristea LL, Leobacher G.
europepmc   +1 more source

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

open access: yesMath Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source

Home - About - Disclaimer - Privacy