Matroidal bijections between graphs

From MaRDI portal





The authors study 5 classes of bijections between the edge sets of two graphs, e.g. those induced by a homomorphism (called ``chromatic maps) and those preserving cycles (called ``cyclic maps). All five conditions are quite natural when one considers graphs as binary matroids. These classes of map give rise to parameters of the graph G (e.g., chromatic maps lead to the well-known chromatic number) which are then studied in detail.











This page was built for publication: Matroidal bijections between graphs

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