A characterization of uniquely vertex colorable graphs using minimal defining sets

DOI10.1016/S0012-365X(98)00304-5zbMath0938.05031OpenAlexW2030327493MaRDI QIDQ1297453

V. Pereyra

Publication date: 5 June 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00304-5

zbMATH Keywords

characterizationcoloringuniquely colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On defining numbers of circular complete graphs, Unique irredundance, domination and independent domination in graphs

Cites Work

• Advances in graph theory
• Defining sets in vertex colorings of graphs and latin rectangles
• Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs
• Uniquely colorable graphs
• Unnamed Item
• Unnamed Item