Results 91 to 100 of about 405,795 (217)
Edge Partitions of Complete Geometric Graphs (Part 2) [PDF]
, 2021 Oswin Aichholzer +7 more
openalex +1 more source
, 1994 If G = (V,E) is a simple graph of order p and size q, and if P is a property held by G, we say that G is P-completable if there is an ordering d, e2, . . . , e(p)_g of the edges of Kv- G such that Gk = (V, E + Uf=i Ct) has property P for each k- 1,2, . . . , Q- q. The sequence {Gk} is called a P-completion sequence.
openaire +3 more sources
Coherence as resource in scattering quantum walk search on complete graph. [PDF]
Sci Rep, 2018 Su YL, Liu SY, Wang XH, Fan H, Yang WL.
europepmc +1 more source
EMBEDDING OF COMPLETE MULTIPARTITE GRAPHS INTO CYCLE-OF-LADDERS [PDF]
, 2020 Jia‐Bao Liu, R Karthik, Satish Kumar
openalex +1 more source
Spatial evolutionary public goods game on complete graph and dense complex networks. [PDF]
Sci Rep, 2015 Kim J, Chae H, Yook SH, Kim Y.
europepmc +1 more source
The Complete List of Ramsey (2K2,K4)-Minimal Graphs [PDF]
, 2015 Kristiana Wijaya +3 more
openalex +1 more source
Determining the b-chromatic number of subdivision-vertex neighbourhood coronas
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaLet G and H be two graphs, each one of them being a path, a cycle or a star. In this paper, we determine the b-chromatic number of every subdivision-vertex neighbourhood corona G ⊡ H or G ⊡ Kn, where Kn is the complete graph of order n.
Falcón Raúl M. +2 more
doaj +1 more source
Graph decomposition is NPC - a complete proof of Holyer's conjecture [PDF]
, 1992 Dorit Dor, Michael Tarsi
openalex +1 more source