The circular chromatic number of a digraph
From MaRDI portal
Publication:4474287
DOI10.1002/jgt.20003zbMath1041.05026OpenAlexW2755175264MaRDI QIDQ4474287
Drago Bokal, Gašper Fijavž, P. Mark Kayll, Bojan Mohar, Martin Juvan
Publication date: 4 August 2004
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20003
Related Items (50)
The \(m\)-degenerate chromatic number of a digraph ⋮ On the dichromatic number of surfaces ⋮ Acyclic coloring parameterized by directed clique-width ⋮ Finding good 2-partitions of digraphs. I. Hereditary properties ⋮ Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ Digraphs and Variable Degeneracy ⋮ The core of housing markets from an agent's perspective: Is it worth sprucing up your home? ⋮ On random digraphs and cores ⋮ Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization ⋮ The minimum number of edges in 4-critical digraphs of given order ⋮ Circular coloring of planar digraphs ⋮ Complexity of stability in trading networks ⋮ Game-perfect digraphs ⋮ Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number ⋮ The removal lemma for tournaments ⋮ Four proofs of the directed Brooks' theorem ⋮ Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph ⋮ Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees ⋮ Acyclic coloring of products of digraphs ⋮ The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number ⋮ Two results on the digraph chromatic number ⋮ Planar Digraphs of Digirth Four are 2-Colorable ⋮ Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring ⋮ Spectral radius of digraphs with given dichromatic number ⋮ DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER ⋮ On the parameterized complexity of 2-partitions ⋮ Planar Digraphs of Digirth Five Are 2-Colorable ⋮ Cycle reversions and dichromatic number in tournaments ⋮ The distance spectral radius of digraphs ⋮ Unnamed Item ⋮ Coloring digraphs with forbidden cycles ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs ⋮ The edge density of critical digraphs ⋮ A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth ⋮ Eigenvalues and colorings of digraphs ⋮ Spectral radius of strongly connected digraphs ⋮ Acyclic systems of representatives and acyclic colorings of digraphs ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ On the growth rate of dichromatic numbers of finite subdigraphs ⋮ On the Complexity of Digraph Colourings and Vertex Arboricity ⋮ Acyclic subgraphs of planar digraphs ⋮ Paths, cycles and circular colorings in digraphs ⋮ The chromatic polynomial of a digraph ⋮ The star dichromatic number ⋮ Coloring tournaments: from local to global ⋮ A connection between circular colorings and periodic schedules ⋮ Complexity of some arc-partition problems for digraphs ⋮ Acyclic Digraphs ⋮ Perfect Digraphs
Cites Work
This page was built for publication: The circular chromatic number of a digraph
