scientific article; zbMATH DE number 7795666

zbMath1529.05066arXiv2307.09461MaRDI QIDQ6183284

No author found.

Publication date: 26 January 2024

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

homomorphismsgirthoriented graphoriented chromatic number

Mathematics Subject Classification ID

Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth
• A hypergraph-free construction of highly chromatic graphs without short cycles
• On sparse graphs with given colorings and homomorphisms.
• Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
• Uniquely D-colourable Digraphs with Large Girth
• Graph Theory and Probability
• Uniquely Colourable Graphs with Large Girth
• The circular chromatic number of a digraph
• On chromatic number of finite set-systems

This page was built for publication: