On the maximum average degree and the oriented chromatic number of a graph
From MaRDI portal
Publication:1304809
DOI10.1016/S0012-365X(98)00393-8zbMath0932.05033WikidataQ115927290 ScholiaQ115927290MaRDI QIDQ1304809
Jaroslav Nešetřil, Eric Sopena, Alexandr V. Kostochka, Oleg V. Borodin, Andre Raspaud
Publication date: 29 November 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The acircuitic directed star arboricity of subcubic graphs is at most four, On the oriented chromatic number of grids, Antisymmetric flows and strong colourings of oriented graphs, Homomorphisms and oriented colorings of equivalence classes of oriented graphs, Homomorphisms from sparse graphs with large girth., On universal graphs for planar oriented graphs of a given girth, Colored homomorphisms of colored mixed graphs, On deeply critical oriented graphs, Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\), On some arboricities in planar graphs, Oriented vertex and arc colorings of partial 2-trees, Strong oriented chromatic number of planar graphs without cycles of specific lengths