On the δ-chromatic numbers of the Cartesian products of graphs
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
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
A new error estimate on uniform norm of Schwarz algorithm for elliptic quasi-variational inequalities with nonlinear source terms. [PDF]
Mehri A, Saadi S.
europepmc +1 more source
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [PDF]
Nagoor Gani A, Latha SR.
europepmc +1 more source
On the length of arcs in labyrinth fractals. [PDF]
Cristea LL, Leobacher G.
europepmc +1 more source
New algorithms for maximum disjoint paths based on tree-likeness. [PDF]
Fleszar K, Mnich M, Spoerhase J.
europepmc +1 more source
Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]
Afridi MUK, Rehman IU, Ishaq M.
europepmc +1 more source
EXTREME VALUES OF THE FIEDLER VECTOR ON TREES. [PDF]
Lederman RR, Steinerberger S.
europepmc +1 more source
A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups. [PDF]
Gollin JP +4 more
europepmc +1 more source
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]
Aichholzer O +4 more
europepmc +1 more source

