Oriented coloring on recursively defined digraphs

DOI10.3390/a12040087zbMath1461.68154arXiv1904.01570MaRDI QIDQ2003341

Frank Gurski, Carolin Rehs, Dominique Komander

Publication date: 8 July 2019

Published in: Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

oriented graphs; graph isomorphism; oriented coloring; oriented co-graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)