Pages that link to "Item:Q1158161"
From MaRDI portal
The following pages link to On the arc-chromatic number of a digraph (Q1158161):
Displaying 30 items.
- Covering digraphs with small indegrees or outdegrees by directed cuts (Q389984) (← links)
- On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees (Q495674) (← links)
- Hedetniemi's conjecture for uncountable graphs (Q509108) (← links)
- A study of 3-arc graphs (Q628319) (← links)
- Hedetniemi's conjecture and dense Boolean lattices (Q634737) (← links)
- Interleaved adjoints of directed graphs (Q648963) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- In praise of homomorphisms (Q826325) (← links)
- On the chromatic number and independence number of hypergraph products (Q858686) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- On multiplicative graphs and the product conjecture (Q1110530) (← links)
- Multiplicativity of acyclic digraphs (Q1377696) (← links)
- Generic automorphisms and graph coloring (Q1772278) (← links)
- Lattices arising in categorial investigations of Hedetniemi's conjecture (Q1917488) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- Note on Hedetniemi's conjecture and the Poljak-Rödl function (Q2058954) (← links)
- Proper distinguishing arc-colourings of symmetric digraphs (Q2079126) (← links)
- Hedetniemi's conjecture is asymptotically false (Q2221935) (← links)
- Counterexamples to Hedetniemi's conjecture (Q2274002) (← links)
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture (Q2338641) (← links)
- A note on total colourings of digraphs (Q2509309) (← links)
- Chromatic numbers and products (Q2570106) (← links)
- Multiplicative graphs and semi-lattice endomorphisms in the category of graphs (Q2573651) (← links)
- The categorical product of two 5-chromatic digraphs can be 3-chromatic (Q2581426) (← links)
- Digraphs Products (Q3120442) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- Iterated arc graphs (Q4683356) (← links)
- Distinguishing arc-colourings of symmetric digraphs (Q5058208) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
