×

Found 382 Documents (Results 1–100)

The Weisfeiler-Leman algorithm and recognition of graph properties. (English) Zbl 1517.05166

Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 245-257 (2021).
MSC:  05C85 05C60 05E30
PDFBibTeX XMLCite
Full Text: DOI

Sparse Kneser graphs are Hamiltonian. (English) Zbl 1428.05179

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 912-919 (2018).
MSC:  05C45
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Vertex-transitive Haar graphs that are not Cayley graphs. (English) Zbl 1409.05100

Conder, Marston D. E. (ed.) et al., Discrete geometry and symmetry. Dedicated to Károly Bezdek and Egon Schulte on the occasion of their 60th birthdays. Selected papers based on the presentations at the conference ‘Geometry and symmetry’, Veszprém, Hungary, June 29 – July 3, 2015. Cham: Springer. Springer Proc. Math. Stat. 234, 61-70 (2018).
MSC:  05C25 05E18 20B25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field