Results 11 to 20 of about 2,800 (259)
Vertex-colouring edge-weightings with two edge weights [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graphs and ...
Mahdad Khatirinejad +4 more
doaj +1 more source
Partitions and Edge Colourings of Multigraphs [PDF]
The Electronic Journal of Combinatorics, 2008 Erdős and Lovász conjectured in 1968 that for every graph $G$ with $\chi(G)>\omega(G)$ and any two integers $s,t\geq 2$ with $s+t=\chi(G)+1$, there is a partition $(S,T)$ of the vertex set $V(G)$ such that $\chi(G[S])\geq s$ and $\chi(G[T])\geq t$. Except for a few cases, this conjecture is still unsolved.
Alexandr V. Kostochka, Michael Stiebitz
openaire +3 more sources
Visual‐attention GAN for interior sketch colourisation
IET Image Processing, 2021 In the professional field of interior designing, sketch colouring is often a time‐consuming and vapidity task. The traditional neural network does not handle the semantic relationship of sketch lines well, and the colouring effect is unsatisfactory. This
Xinrong Li +4 more
doaj +1 more source
On Supereulerian 2-Edge-Coloured Graphs [PDF]
Graphs and Combinatorics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jørgen Bang-Jensen +2 more
openaire +4 more sources
Proper Rainbow Connection Number of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct colours. An edge-coloured graph is said to be rainbow connected if any two distinct vertices of the graph are connected by a rainbow path.
Doan Trung Duy, Schiermeyer Ingo
doaj +1 more source
List circular backbone colouring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge.
Frederic Havet, Andrew D. King
doaj +1 more source
On graphs double-critical with respect to the colouring number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The colouring number col($G$) of a graph $G$ is the smallest integer $k$ for which there is an ordering of the vertices of $G$ such that when removing the vertices of $G$ in the specified order no vertex of degree more than $k-1$ in the remaining graph ...
Matthias Kriesell, Anders Pedersen
doaj +1 more source
Acyclic, Star and Oriented Colourings of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let G be a graph with chromatic number χ (G). A vertex colouring of G is \emphacyclic if each bichromatic subgraph is a forest. A \emphstar colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χ _a(G) and χ _s(G)
David R. Wood
doaj +3 more sources
On Small Balanceable, Strongly-Balanceable and Omnitonal Graphs
Discussiones Mathematicae Graph Theory, 2022 In Ramsey Theory for graphs we are given a graph G and we are required to find the least n0 such that, for any n ≥ n0, any red/blue colouring of the edges of Kn gives a subgraph G all of whose edges are blue or all are red.
Caro Yair, Lauri Josef, Zarb Christina
doaj +1 more source
Complexity of greedy edge-colouring [PDF]
Journal of the Brazilian Computer Society, 2015 The Grundy index of a graph G = (V, E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the Grundy index of a graph G = (V, E) is NP-hard for general graphs. We also show that this problem is polynomial-time solvable for caterpillars.
Havet, Frédéric +2 more
openaire +2 more sources