Arc colorings of digraphs

DOI10.1016/0095-8956(72)90057-3zbMath0231.05105OpenAlexW1997657048WikidataQ105989378 ScholiaQ105989378MaRDI QIDQ2550401

C. C. Harner, Roger Entringer

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90057-3

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

Independent sets in subgraphs of a shift graph, Constructing colorings for diagrams, Topology and Adjunction in Promise Constraint Satisfaction, Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\), Flipping triangles and rectangles, Covering digraphs with small indegrees or outdegrees by directed cuts, Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank, Boolean dimension and local dimension, A study of 3-arc graphs, On the arc-chromatic number of a digraph, Shift graphs on precompact families of finite sets of natural numbers, ON THE DICHROMATIC INDEX OF A DIGRAPH, The degree-diameter problem for sparse graph classes, On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees, Hedetniemi's conjecture and adjoint functors in thin categories, Invertible and nilpotent matrices over antirings, Iterated arc graphs, A note on total colourings of digraphs, Borel chromatic numbers, Miscellaneous Digraph Classes, Extractors for small zero-fixing sources

Cites Work

• Parallel concepts in graph theory
• Unnamed Item
• Unnamed Item