Results 91 to 100 of about 267 (133)
Almost All Graphs With 2.522n Edges Are Not 3-Colorable
, 1999 We prove that for c 2:522 a random graph with n vertices and m = cn edges is not 3-colorable with probability 1 \Gamma o(1). Similar bounds for non-k-colorability are given for k ? 3.
Achlioptas, D. +3 more
core
Local Conditions for Edge-Coloring
, 1995 In this note, we investigate three versions of the overfull property for graphs and their relation to the edge-coloring problem. Each of these properties implies that the graph cannot be edge-colored with \Delta colors, where \Delta is the maximum degree.
Celina M. H. De Figueiredo +2 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 +3 more
core
Monochromatic configurations on a circle
\enlargethispage{.2cm} If we two-colour a circle, we can always find an inscribed triangle with angles \((\frac{\pi}{7},\frac{2\pi}{7},\frac{4\pi}{7})\) whose three vertices have the same colour.
Gábor Damásdi +3 more
core +1 more source
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. +3 more
core
Almost every complement of a tadpole graph is not chromatically unique
, 2013 The study of chromatically unique graphs has been drawing much attention and many results are surveyed in [4, 12, 13]. The notion of adjoint polynomials of graphs was first introduced and applied to the study of the chromaticity of the complements of the
F. Belardo (23465554) +5 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 +4 more
core
Novel procedures for graph edge-colouring
, 2018 Orientador: Dr. Renato CarmoCoorientador: Dr. André Luiz Pires GuedesTese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática.
Zatesko, Leandro Miranda, 1988-
core
Distance-based topological polynomials and indices of friendship graphs. [PDF]
Springerplus, 2016 Gao W +3 more
europepmc +1 more source