๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Defining sets and uniqueness in graph colorings: A survey

โœ Scribed by E.S. Mahmoodian

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
66 KB
Volume
73
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A characterization of uniquely vertex co
A characterization of uniquely vertex colorable graphs using minimal defining sets
โœ H. Hajiabolhassan; M.L. Mehrabadi; R. Tusserkani; M. Zaker ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 267 KB

A defining set (sf cute-x coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We define a minimal d&kg set to be a defining set which does not properly contain another defining set. If G is a uniquely ver

Defining sets in vertex colorings of gra
Defining sets in vertex colorings of graphs and latin rectangles
โœ E.S. Mahmoodian; Reza Naserasr; Manouchehr Zaker ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 410 KB

In a given graph G, a set of vertices S with an assignment of colors is said to be a defining set of the vertex coloring of G, if there exists a unique extension of the colors of S to a z(G)coloring of the vertices of G. The concept of a defining set has been studied, to some extent, for block desig

Very rapidly mixing Markov chains for 2ฮ”
Very rapidly mixing Markov chains for 2ฮ”-colorings and for independent sets in a graph with maximum degree 4
โœ Michael Molloy ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 140 KB ๐Ÿ‘ 1 views

We introduce a new technique for analyzing the mixing rate of Markov chains. We use it to prove that the Glauber dynamics on 2 -colorings of a graph with maximum degree mixes in O n log n time. We prove the same mixing rate for the Insert/Delete/Drag chain of Dyer and Greenhill (Random Structures A