Circular colorings of edge-weighted graphs
From MaRDI portal
Publication:4406066
DOI10.1002/jgt.10106zbMath1014.05026OpenAlexW4245278569MaRDI QIDQ4406066
Publication date: 25 June 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10106
Related Items (24)
Acyclic coloring parameterized by directed clique-width ⋮ Digraphs and Variable Degeneracy ⋮ Hadwiger's conjecture for circular colorings of edge-weighted graphs ⋮ Four proofs of the directed Brooks' theorem ⋮ Resource-sharing systems and hypergraph colorings ⋮ Two results on the digraph chromatic number ⋮ Collective dynamics of phase-repulsive oscillators solves graph coloring problem ⋮ Spectral radius of digraphs with given dichromatic number ⋮ DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER ⋮ Circular \(L(j,k)\)-labeling number of direct product of path and cycle ⋮ The distance spectral radius of digraphs ⋮ Coloring digraphs with forbidden cycles ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ The edge density of critical digraphs ⋮ The minimum feedback arc set problem and the acyclic disconnection for graphs ⋮ Eigenvalues and colorings of digraphs ⋮ A note onn-tuple colourings and circular colourings of planar graphs with large odd girth ⋮ \(L(j,k)\)-labeling number of Cartesian product of path and cycle ⋮ Paths, cycles and circular colorings in digraphs ⋮ The star dichromatic number ⋮ A connection between circular colorings and periodic schedules ⋮ Dichromatic number and forced subdivisions ⋮ Tournaments and Semicomplete Digraphs ⋮ On circular-L(2, 1)-labellings of products of graphs
Cites Work
This page was built for publication: Circular colorings of edge-weighted graphs
