Graph structural properties of non-Yutsis graphs allowing fast recognition

DOI10.1016/J.DAM.2008.03.020zbMATH Open1168.05363OpenAlexW2105408747WikidataQ59411501 ScholiaQ59411501MaRDI QIDQ1003683FDOQ1003683

Authors: R. E. L. Aldred, Gunnar Brinkmann, V. Fack, Brendan D. McKay, 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

Recommendations

• To be or not to be Yutsis: algorithms for the decision problem
• On the reduction of Yutsis graphs
• Generation of cubic graphs
• Fast generation of cubic graphs
• scientific article; zbMATH DE number 3952807

zbMATH Keywords

decision problemdual Hamiltonian graphgeneral recoupling coefficientYutsis graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• On the reduction of Yutsis graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast generation of cubic graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The asymptotic connectivity of labelled regular graphs
• To be or not to be Yutsis: algorithms for the decision problem
• Some remarks on Jaeger's dual-hamiltonian conjecture
• Random triangulations of the plane
• Title not available (Why is that?)

Cited In (3)

• Computing the largest bond and the maximum connected cut of a graph
• To be or not to be Yutsis: algorithms for the decision problem
• Induced tree covering and the generalized Yutsis property

Uses Software

• nauty
• GYutsis

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)