Results 31 to 40 of about 4,584 (263)
Improved approximation for maximum edge colouring problem [PDF]
Discrete Applied Mathematics, 2022 13 pages, 4 ...
L. Sunil Chandran +2 more
openaire +3 more sources
A note on the vertex-distinguishing index for some cubic graphs [PDF]
Opuscula Mathematica, 2004 The vertex-distinguishing index of a graph \(G\) (\(\operatorname{vdi}(G)\)) is the minimum number of colours required to colour properly the edges of a graph in such a way that any two vertices are incident with different sets of colours.
Karolina Taczuk, Mariusz Woźniak
doaj
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Forum of Mathematics, Sigma, 2020 A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Komlós, Sárközy, and Szemerédi that applies to almost optimally bounded colourings.
Stefan Ehard, Stefan Glock, Felix Joos
doaj +1 more source
On the non-ergodicity of the Swendsen-Wang-Kotecky algorithm on the kagome lattice [PDF]
, 2010 We study the properties of the Wang-Swendsen-Kotecky cluster Monte Carlo algorithm for simulating the 3-state kagome-lattice Potts antiferromagnet at zero temperature.
Altschulter A +15 more
core +2 more sources
Critical and Flow-Critical Snarks Coincide
Discussiones Mathematicae Graph Theory, 2021 Over the past twenty years, critical and bicritical snarks have been appearing in the literature in various forms and in different contexts. Two main variants of criticality of snarks have been studied: criticality with respect to the non-existence of a ...
Máčajová Edita, Škoviera Martin
doaj +1 more source
Ars Mathematica Contemporanea, 2011 A facial parity edge colouring of a connected bridgeless plane graph is an edge colouring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same colour, in addition, for each face α and each colour c, either no edge or an odd number of edges incident with α is coloured with c.
Czap, Július +2 more
openaire +3 more sources
Journal of Combinatorial Theory, Series B, 1988 Let \(G_{n,p}\) be the random graph with vertex set \(V_ n=\{1,2,...,n\}\) in which the \(\binom{n}{2}\) possible edges occur independently with probability p.
Frieze, A.M +3 more
openaire +2 more sources
Monochromatic Clique Decompositions of Graphs [PDF]
, 2014 Let $G$ be a graph whose edges are coloured with $k$ colours, and $\mathcal H=(H_1,\dots , H_k)$ be a $k$-tuple of graphs. A monochromatic $\mathcal H$-decomposition of $G$ is a partition of the edge set of $G$ such that each part is either a single edge
Győri E. +6 more
core +4 more sources
Bilangan Kromatik Grap Commuting dan Non Commuting Grup Dihedral
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2015 Commuting graph is a graph that has a set of points X and two different vertices to be connected directly if each commutative in G. Let G non abelian group and Z(G) is a center of G.
Handrini Rahayuningtyas +2 more
doaj +1 more source
Partitioning edge-coloured complete graphs into monochromatic cycles and paths
, 2012 A conjecture of Erd\H{o}s, Gy\'arf\'as, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been proven only for r
Alexey Pokrovskiy +10 more
core +1 more source