Results 31 to 40 of about 45,743 (261)
Brooks’ Theorem via the Alon–Tarsi Theorem
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hladký, Jan +2 more
openaire +4 more sources
A short proof of Brooks’ Theorem for vertex arboricity
AKCE International Journal of Graphs and Combinatorics, 2020 The vertex-arboricity of a graph is the minimum number of subsets that the vertices of can be partitioned so that the subgraph induced by each set of vertices is a forest. Kronk and Mitchem proved a generalization of Brooks’ Theorem for vertex arboricity,
Allan Bickle
doaj +1 more source
Isogeny graphs of ordinary abelian varieties [PDF]
, 2016 Fix a prime number $\ell$. Graphs of isogenies of degree a power of $\ell$ are well-understood for elliptic curves, but not for higher-dimensional abelian varieties.
Brooks, Ernest Hunter +2 more
core +2 more sources
Colourings of $(m, n)$-coloured mixed graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is assigned one of ...
Gary MacGillivray +2 more
doaj +1 more source
On DP-Coloring of Digraphs [PDF]
, 2018 DP-coloring is a relatively new coloring concept by Dvo\v{r}\'ak and Postle and was introduced as an extension of list-colorings of (undirected) graphs.
Bang-Jensen, Jørgen +3 more
core +3 more sources
Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring [PDF]
, 2023 Lucas Picasarri‐Arrieta
+6 more sources
A noncommutative Brooks–Jewett Theorem
Journal of Mathematical Analysis and Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chetcuti, E., Hamhalter, J.
openaire +1 more source
Chromatic Ramsey number of acyclic hypergraphs [PDF]
, 2015 Suppose that $T$ is an acyclic $r$-uniform hypergraph, with $r\ge 2$. We define the ($t$-color) chromatic Ramsey number $\chi(T,t)$ as the smallest $m$ with the following property: if the edges of any $m$-chromatic $r$-uniform hypergraph are colored with
Gyárfás, András +2 more
core +2 more sources
Journal of Combinatorial Theory, 1969 AbstractThe new proof is shorter than the original one [1] and emphasizes the important role of recoloring of two-color chains in questions related to chromatic number of graphs.
Melnikov, L.S., Vizing, V.G.
openaire +2 more sources
, 2009 Let M be a hyperbolic 3-manifold with nonempty totally geodesic boundary. We prove that there are upper and lower bounds on the diameter of the skinning map of M that depend only on the volume of the hyperbolic structure with totally geodesic boundary ...
Kent Iv, Richard Peabody
core +1 more source