Defining sets in vertex colorings of graphs and latin rectangles

DOI10.1016/S0012-365X(96)00247-6zbMath0879.05028OpenAlexW2126105838WikidataQ57258549 ScholiaQ57258549MaRDI QIDQ1356483

Reza Naserasr, Manouchehr Zaker, Ebadollah S. Mahmoodian

Publication date: 12 January 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00247-6

zbMATH Keywords

defining setvertex colouringcritical setlatin squarelatin rectangle

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items

Determination of the size of defining set for Steiner triple systems, Complete forcing numbers of primitive coronoids, On the computational complexity of defining sets, Complete forcing numbers of complete and almost-complete multipartite graphs, Generalized Latin squares and their defining sets, Note on property \(M(k)\) of some complete multipartite graphs, Extremal anti-forcing numbers of perfect matchings of graphs, Complete forcing numbers of hexagonal systems, Silver cubes, Defining numbers in some of the Harary graphs, On the forced matching numbers of bipartite graphs, On defining numbers of vertex colouring of regular graphs, A characterization of uniquely vertex colorable graphs using minimal defining sets, Defining sets and uniqueness in graph colorings: A survey, Unique list-colourability and the fixing chromatic number of graphs, Complete forcing numbers of catacondensed hexagonal systems, Greedy defining sets in graphs and Latin squares, The restrained geodetic number of a graph

Cites Work

• On Topological Invariants of the Product of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item