Clique‐convergence is undecidable for automatic graphs-Reference-Cited by-同舟云学术

Clique‐convergence is undecidable for automatic graphs

Published:2020-10-07 Issue:3 Volume:96 Page:414-437
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J Graph Theory

Author:

Cedillo C.¹²,Pizaña M. A.¹^ORCID

Affiliation:

1. Universidad Autónoma Metropolitana ‐ Iztapalapa Mexico City Mexico

2. Centro Universitario UAEM Nezahualcóyotl Nezahualcoyotl City Mexico

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.22622

Reference25 articles.

1. V.Bárány Automatic presentations of infinite structures Ph.D. Thesis RWTH Aachen University Budapest Hungary 2007 available athttps://logic.rwth-aachen.de/~vbarany/diss.pdf

2. Finite presentations of infinite structures: automata and interpretations;Blumensath A.;Theory Comput. Syst.,2004

3. Graph Theory with Applications

4. On self‐clique graphs all of whose cliques have equal size;Chia G. L.;Ars Combin.,2012

5. F. F.Dragan Centers of graphs and the Helly property Ph.D. Thesis Moldava State University Chisinǎu Moldava 1989(in Russian).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Characterising clique convergence for locally cyclic graphs of minimum degree δ ≥ 6;Discrete Mathematics;2024-11

2. On the clique behavior and Hellyness of the complements of regular graphs;Discrete Mathematics;2023-02

3. On the clique behavior of graphs of low degree;Boletín de la Sociedad Matemática Mexicana;2022-05-21

4. Studying the A4-graphs for elements of order three in tits group T and Mathieu group M;INT J NONLINEAR ANAL;2021