Defining sets and uniqueness in graph colorings: A survey

DOI10.1016/S0378-3758(98)00053-6zbMath0935.05048OpenAlexW2016968630MaRDI QIDQ1299076

Ebadollah S. Mahmoodian

Publication date: 4 May 2000

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(98)00053-6

zbMATH Keywords

uniquenessLatin squarescoloringblock designscritical setdefining sets

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Latin trades on three or four rows, Critical sets for Sudoku and general graph colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On uniquely 3-colorable graphs
• Some classes of uniquely 3-colorable graphs
• On uniquely 3-colorable planar graphs
• Uniquely colorable graphs
• Defining sets in vertex colorings of graphs and latin rectangles
• Uniquely total colorable graphs
• The size of uniquely colorable graphs
• Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs
• Uniquely Colourable Graphs with Large Girth
• Critical sets in latin squares and their application to minimal defining sets of designs
• Uniquely colorable graphs
• On uniquely colorable planar graphs