The Logic of Graph-Theoretic Duality

From MaRDI portal





Classical graph-theoretic duality is based on the relationship between circuits and cutsets. This duality is surveyed and formulated syntactically. By removing the dependence on a distinguished edge, a second duality between spanning trees and cutsets is found. Finally, the new duality is applied to the maximal distance between spanning trees of a graph.











This page was built for publication: The Logic of Graph-Theoretic Duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720645)