Results 31 to 40 of about 2,800 (259)
Distance edge-colourings and matchings
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ross J. Kang, Putra Manggala
openaire +3 more sources
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
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
(1, 2)-rainbow connection number at most 3 in connected dense graphs
Electronic Journal of Graph Theory and Applications, 2023 Let G be an edge-coloured connected graph G. A path P in the graph G is called l-rainbow path if each subpath of length at most l + 1 is rainbow. The graph G is called (k, l)-rainbow connected if any two vertices in G are connected by at least k pairwise
Trung Duy Doan, Le Thi Duyen
doaj +1 more source
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.
Alan M. Frieze +3 more
openaire +2 more sources
Discrete Mathematics & Theoretical Computer Science, 2004 A (k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +2 more sources
A PROCEDURE FOR DERIVING ODD-GRACEFUL CHROMATIC NUMBERS OF GRAPHS
Ural Mathematical JournalLet \(G:=(V,E)\) be an undirected finite simple graph with vertex set \(V\) and edge set \(E\). A function \(c:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\), such that \(c(u)\neq c(v)\) for every edge \(uv\in E(G)\), is called a ...
I Nengah Suparta +3 more
doaj +1 more source
Edges, colour and awareness in blindsight
Consciousness and Cognition, 2010 It remains unclear what is being processed in blindsight in response to faces, colours, shapes, and patterns. This was investigated in two hemianopes with chromatic and achromatic stimuli with sharp or shallow luminance or chromatic contrast boundaries or temporal onsets. Performance was excellent only when stimuli had sharp spatial boundaries.
Alexander, I, Cowey, A
openaire +2 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
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source