Results 1 to 10 of about 14 (14)

On Nordhaus-Gaddum type relations of δ-complement graphs. [PDF]

Heliyon, 2023
Vichitkunakorn P, Maungchang R, Tangjai W.   +2 more
europepmc   +1 more source

Application of maple on computing strong fuzzy chromatic polynomial of fuzzy graphs. [PDF]

BMC Res Notes, 2022
Ashebo MA, Rathour L, Repalle VNS.
europepmc   +1 more source

The complexity of frugal colouring. [PDF]

Arab J Math, 2021
Bard S, MacGillivray G, Redlin S.
europepmc   +1 more source

Distance-based topological polynomials and indices of friendship graphs. [PDF]

Springerplus, 2016
Gao W, Farahani MR, Imran M, Rajesh Kanna MR.   +3 more
europepmc   +1 more source

On dihedral flows in embedded graphs. [PDF]

J Graph Theory, 2019
Litjens B.
europepmc   +1 more source

Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. [PDF]

Math Program, 2018
Gribling S, de Laat D, Laurent M.
europepmc   +1 more source

Diversity of capsular polysaccharide gene clusters in Kpc-producing Klebsiella pneumoniae clinical isolates of sequence type 258 involved in the Italian epidemic. [PDF]

PLoS One, 2014
D'Andrea MM, Amisano F, Giani T, Conte V, Ciacci N, Ambretti S, Santoriello L, Rossolini GM.   +7 more
europepmc   +1 more source

A Graph Coloring Algorithm for Large Scheduling Problems. [PDF]

J Res Natl Bur Stand (1977), 1979
Leighton FT.
europepmc   +1 more source

Further results on the radio number for some construction of the path, complete, and complete bipartite graphs. [PDF]

Heliyon
Mari B, Jeyaraj RS.
europepmc   +1 more source

Computing dominant metric dimensions of certain connected networks. [PDF]

Heliyon
Ali I, Javaid M, Shang Y.
europepmc   +1 more source