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.
Recommendations
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 3937197 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3556150 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Lower bounds for constant weight codes
- Orientability of matroids
- Semi-duality and the cycle double cover conjecture
Cited in
(15)- Circuit preserving edge maps. II
- On the chromatic number of cube-like graphs
- Exact distance graphs of product graphs
- On tension-continuous mappings
- New results on two hypercube coloring problems
- Around Borsuk's hypothesis
- Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
- When do two planted graphs have the same cotransversal matroid?
- Tension continuous maps -- their structure and applications
- The chromatic number of the square of the 8-cube
- Ball packings with high chromatic numbers from strongly regular graphs
- Homomorphisms from the torus
- On 1-skeleton of the cut polytopes
- On a hypercube coloring problem
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
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)