On the arc-chromatic number of a digraph
From MaRDI portal
Publication:1158161
DOI10.1016/S0095-8956(81)80024-XzbMath0472.05024OpenAlexW2048118184WikidataQ64356948 ScholiaQ64356948MaRDI QIDQ1158161
Vojtěch Rödl, Svatopluk Poljak
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(81)80024-x
Related Items
Topology and Adjunction in Promise Constraint Satisfaction, In praise of homomorphisms, Distinguishing arc-colourings of symmetric digraphs, On the chromatic number and independence number of hypergraph products, On multiplicative graphs and the product conjecture, Lattices arising in categorial investigations of Hedetniemi's conjecture, Multiplicativity of acyclic digraphs, Coloring graph products---a survey, Covering digraphs with small indegrees or outdegrees by directed cuts, Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank, A study of 3-arc graphs, Hedetniemi's conjecture and dense Boolean lattices, Interleaved adjoints of directed graphs, Hedetniemi's conjecture is asymptotically false, On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees, Hedetniemi's conjecture for uncountable graphs, Hedetniemi's conjecture and adjoint functors in thin categories, Generic automorphisms and graph coloring, Counterexamples to Hedetniemi's conjecture, Iterated arc graphs, A note on total colourings of digraphs, Note on Hedetniemi's conjecture and the Poljak-Rödl function, Proper distinguishing arc-colourings of symmetric digraphs, Adaptable chromatic number of graph products, Digraphs Products, Miscellaneous Digraph Classes, Chromatic numbers and products, Multiplicative graphs and semi-lattice endomorphisms in the category of graphs, On inverse powers of graphs and topological implications of Hedetniemi's conjecture, The categorical product of two 5-chromatic digraphs can be 3-chromatic
Cites Work
