Graph structural properties of non-Yutsis graphs allowing fast recognition
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3908476 (Why is no real title available?)
- scientific article; zbMATH DE number 3180958 (Why is no real title available?)
- scientific article; zbMATH DE number 3743204 (Why is no real title available?)
- scientific article; zbMATH DE number 3480616 (Why is no real title available?)
- scientific article; zbMATH DE number 874369 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Fast generation of cubic graphs
- On the reduction of Yutsis graphs
- Random triangulations of the plane
- Some remarks on Jaeger's dual-hamiltonian conjecture
- The asymptotic connectivity of labelled regular graphs
- To be or not to be Yutsis: algorithms for the decision problem
Cited in
(3)
This page was built for publication: Graph structural properties of non-Yutsis graphs allowing fast recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003683)