𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Bisimulation Problem for Equational Graphs of Finite Out-Degree

✍ Scribed by Sénizergues, Géraud

Book ID
118181112
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
681 KB
Volume
34
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of the T-coloring problem
The complexity of the T-coloring problem for graphs with small degree
✍ Krzysztof Giaro; Robert Janczewski; Michał Małafiejski 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 194 KB

In the paper we consider a generalized vertex coloring model, namely T -coloring. For a given ÿnite set T of nonnegative integers including 0, a proper vertex coloring is called a T -coloring if the distance of the colors of adjacent vertices is not an element of T . This problem is a generalization

On the Isomorphism Problem for Finite Ca
On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency
✍ C.H. Li; C.E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 187 KB

For a subset S of a group G such that 1 / ∈ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 ∈ S. Each σ ∈ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S σ ). For a positive integer m, th