Results 181 to 190 of about 9,631,849 (193)
On the pushable chromatic number of various types of grids
Discrete Applied Mathematics, 2023 International audiencePushing a vertex in an oriented graph means reversing the direction of all the arcs incident to that vertex, resulting in another oriented graph.
Soumen Nandi +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees
Graphs and Combinatorics, 2003The oriented graph coloring game was introduced by \textit{J. Nešetřil} and \textit{E. Sopena} [Electron. J. Comb. 8, Research Paper R14 (2001; Zbl 0982.05049)] as follows: Given an oriented graph \(G=(V,A)\) and a tournament \(T = (C,D)\), two players alternately color vertices of \(G\) with colors from the set \(C\) such that, if \(v \in V\) is to be
Henry A. Kierstead +2 more
exaly +4 more sources
A note on orientation and chromatic number of graphs
Journal of Combinatorial Optimization, 2016Let \(G\) be a simple and finite graph, and let \(D\) be an orientation of \(G\). If \(D\) has a directed path of order \(k\), then define \(\Delta_k(D)\) to be the maximum value \(t\) for which a directed path \(v_1\dots v_k\) in \(D\) satisfies that the outdegree of \(v_k\) in \(D\) is \(t\); otherwise, define \(\Delta_k(D)\) to be zero.
openaire +1 more source
Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
Combinatorica, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nabil Kahalé, Leonard J. Schulman
openaire +3 more sources
Oriented Hamiltonian paths in digraphs with arbitrary chromatic number
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ayman El Zein
exaly +4 more sources
Finite fields and the 1‐chromatic number of orientable surfaces
Journal of Graph Theory, 2009AbstractThe 1‐chromatic number χ1(Sp) of the orientable surface Sp of genus p is the maximum chromatic number of all graphs which can be drawn on the surface so that each edge is crossed by no more than one other edge. We show that if there exists a finite field of order 4m+1, m≥3, then 8m+2≤χ1(S)≤8m+3, where 8m+3 is Ringel's upper bound on χ1(S ...
openaire +1 more source
The game chromatic number and the game colouring number of classes of oriented cactuses
Information Processing Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephan Dominique Andres +1 more
openaire +1 more source
Paths with two blocks in -chromatic digraphs
Journal of Combinatorial Theory Series B, 2007Frédéric Havet
exaly
The oriented chromatic number of the hexagonal grid is 6
Discrete Applied MathematicsAntoni Lozano Bojados
exaly