Iterated arc graphs

DOI10.14712/1213-7243.2015.260zbMath1463.05188arXiv1610.01259OpenAlexW2964339516WikidataQ128933635 ScholiaQ128933635MaRDI QIDQ4683356

Claude Tardif, Imed Zaguia, David L. Wehlau, Danny Rorabaugh

Publication date: 20 September 2018

Published in: Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.01259

zbMATH Keywords

chromatic numberDedekind numberfree distributive latticearc graph

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On inverse powers of graphs and topological implications of Hedetniemi's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Digraph functors which admit both left and right adjoints
• The level polynomials of the free distributive lattices
• On the arc-chromatic number of a digraph
• Arc colorings of digraphs
• A decomposition theorem for partially ordered sets

This page was built for publication: Iterated arc graphs