Results 81 to 90 of about 149 (111)

On the δ-chromatic numbers of the Cartesian products of graphs

open access: yesOpen Mathematics
In this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee   +2 more
doaj   +1 more source

Global cycle properties in graphs with large minimum clustering coefficient

open access: yes, 2017
Let P be a graph property. A graph G is said to be locally P (closed locally P) if the subgraph induced by the open neighbourhood (closed neighbourhood, respectively) of every vertex in G has property P.
Borchert, Adam   +2 more
core  

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

EXTREME VALUES OF THE FIEDLER VECTOR ON TREES. [PDF]

open access: yesLinear Algebra Appl
Lederman RR, Steinerberger S.
europepmc   +1 more source

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]

open access: yesDiscrete Comput Geom
Aichholzer O   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy