Results 91 to 100 of about 269 (132)
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
Some Results on the Structure of Multipoles in the Study of Snarks ∗
, 2014 AMS classification: 05C15, 05C05, 05C38. Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole M has dangling edges with one free end, which we call semiedges.
J. Vilaltella, M. A. Fiol
core
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.
Michael Molloy, Dimitris Achlioptas
core
List Edge Colourings of Some 1-Factorable Multigraphs
, 1996 The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and any set system fSe : e 2 E(G)g with each jSe j = k, we can choose elements se 2 Se such that se 6= sf whenever e and f are adjacent edges.
Luis Goddyn, M. N. Ellingham
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
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
Largely Blocked C 4 -Designs Mathematics Subject Classification: 05B05; 05C15
, 2013 The problem to determine the existence of possible blocking sets ...
Mario Gionfriddo, Lorenzo Milazzo
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