Results 91 to 100 of about 258 (128)

The Independence Number of Graphs With Large Odd Girth

, 1994
. Let G be an r-regular graph of order n and independence number ff(G). We show that if G has odd girth 2k + 3 then ff(G) n 1\Gamma1=k r 1=k . We also prove similar results for graphs which are not regular.
Tristan Denley
core  

Non-proper edge-colouring of graphs and hereditary graph properties

, 2017
A graph property is any isomorphism-closed class of graphs. A property P is hereditary if, whenever a graph G is in P, and H is a subgraph of G, then H is also in P.
Maritz, Elizabeth C.M., Vetrik, Tomas, Dorfling, Samantha, Smit, Jon   +3 more
core  

On The Equitable Chromatic Number of Complete n-Partite Graphs

, 2007
In this paper, we derive an explicit formula for the equitable chromatic number of a complete n-partite graph Kp 1 ;p 2 ;\Delta\Delta\Delta ;p n . Namely, if there exists a largest integer M such that p i (mod M) !
C. F. Zhang, C. S. Tong, W.C. Shiu, Peter C. B. Lam   +3 more
core  

Online conflict-free coloring for intervals

, 2006
. We consider an online version of the conflict-free coloring of a set of points on the line, where each newly inserted point must be assigned a color upon insertion, and at all times the coloring has to be conflict-free, in the sense that in every ...
Meital Levy, Amos Fiat, Haim Kaplan, Ke Chen, Elchanan Mossel   +4 more
core  

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

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

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

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