Results 31 to 40 of about 2,800 (262)
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
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
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
Distinguishing graphs by edge-colourings
European Journal of Combinatorics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rafal Kalinowski, Monika Pilsniak
openaire +1 more source
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
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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
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
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree [PDF]
Graphs and Combinatorics, 2010 The smallest \(n\) such that every coloring of the edges of the \(n\)-vertex complete graph \(K_n\) must contain a monochromatic star \(K_{1,s+1}\) or a properly edge-colored \(K_t\) is denoted by \(f(s,t)\), Its existence is guaranteed by the Erdős-Rado Canonical Ramsey theorem.
Klas Markström +2 more
openaire +2 more sources