Graph structural properties of non-Yutsis graphs allowing fast recognition
From MaRDI portal
Publication:1003683
DOI10.1016/j.dam.2008.03.020zbMath1168.05363OpenAlexW2105408747WikidataQ59411501 ScholiaQ59411501MaRDI QIDQ1003683
Gunnar Brinkmann, Brendan D. McKay, R. E. L. Aldred, Veerle Fack, Dries Van Dyck
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/9184
Related Items
Uses Software
Cites Work
- To be or not to be Yutsis: algorithms for the decision problem
- On the reduction of Yutsis graphs
- Random triangulations of the plane
- The asymptotic connectivity of labelled regular graphs
- Some remarks on Jaeger's dual-hamiltonian conjecture
- Fast generation of cubic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item