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, Oleg V. Borodin, Eric Sopena, Alexandr V. Kostochka, Andre Raspaud
Publication date: 29 November 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (50)
3-paths in graphs with bounded average degree ⋮ Homomorphisms and colourings of oriented graphs: an updated survey ⋮ A note on the oriented chromatic number of grids ⋮ Oriented colorings of triangle-free planar graphs ⋮ An oriented 6-coloring of planar graphs with girth at least 9 ⋮ Oriented chromatic number of Cartesian products and strong products of paths ⋮ A relaxed case on 1-2-3 conjecture ⋮ On the oriented chromatic number of Halin graphs ⋮ The 2-dipath chromatic number of Halin graphs ⋮ Oriented vertex and arc colorings of outerplanar graphs ⋮ Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) ⋮ The acircuitic directed star arboricity of subcubic graphs is at most four ⋮ \(P_{11}\)-coloring of oriented graphs ⋮ On homomorphisms of oriented graphs with respect to the push operation ⋮ Homomorphism bounds for oriented planar graphs of given minimum girth ⋮ On nice and injective-nice tournaments ⋮ Oriented vertex and arc colorings of partial 2-trees ⋮ Strong oriented chromatic number of planar graphs without cycles of specific lengths ⋮ Oriented chromatic number of grids is greater than 7 ⋮ A survey on packing colorings ⋮ On the pushable chromatic number of various types of grids ⋮ On inducing degenerate sums through 2-labellings ⋮ Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) ⋮ Star 5-edge-colorings of subcubic multigraphs ⋮ Homomorphisms and oriented colorings of equivalence classes of oriented graphs ⋮ Homomorphisms from sparse graphs with large girth. ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ Homomorphisms of 2-edge-colored graphs ⋮ An upper bound for the choice number of star edge coloring of graphs ⋮ Oriented colorings of partial 2-trees ⋮ Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k ⋮ Neighbor sum distinguishing edge colorings of graphs with small maximum average degree ⋮ On interval representations of graphs ⋮ On the oriented chromatic number of grids ⋮ Smaller universal targets for homomorphisms of edge-colored graphs ⋮ Circular Flows in Planar Graphs ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ An oriented coloring of planar graphs with girth at least five ⋮ On star and caterpillar arboricity ⋮ Weak Unit Disk and Interval Representation of Graphs ⋮ Chromatic polynomials of oriented graphs ⋮ Antisymmetric flows and strong colourings of oriented graphs ⋮ 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)\) ⋮ Remarks on proper conflict-free colorings of graphs ⋮ On some arboricities in planar graphs ⋮ The oriented chromatic number of Halin graphs
This page was built for publication: On the maximum average degree and the oriented chromatic number of a graph
