Uniquely colorable graphs up to automorphisms

DOI10.1016/j.amc.2023.128007OpenAlexW4361282618MaRDI QIDQ6160596

Boštjan Brešar, Elżbieta Kleszcz, Tanja Gologranc

Publication date: 26 June 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2023.128007

zbMATH Keywords

outerplanar graphgraph automorphismproper vertex coloring

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• On uniquely 3-colorable graphs
• On uniquely 3-colorable planar graphs
• Uniquely colorable graphs
• On the coloring of signed graphs
• The size of uniquely colorable graphs
• Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
• Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
• Uniquely Colourable Graphs with Large Girth
• A note on uniquely 3-colourable planar graphs
• Unique Colorability and Clique Minors
• Uniquely colorable graphs
• On uniquely colorable planar graphs
• Depth-First Search and Linear Graph Algorithms
• A note on uniquely 10‐colorable graphs

This page was built for publication: Uniquely colorable graphs up to automorphisms