Matroidal bijections between graphs
From MaRDI portal
Recommendations
Cites work
- 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?)
- A Contribution to the Theory of Chromatic Polynomials
- Lower bounds for constant weight codes
- Orientability of matroids
- Semi-duality and the cycle double cover conjecture
Cited in
(14)- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
- Homomorphisms from the torus
- The chromatic number of the square of the 8-cube
- When do two planted graphs have the same cotransversal matroid?
- Tension continuous maps -- their structure and applications
- New results on two hypercube coloring problems
- Exact distance graphs of product graphs
- Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
- Around Borsuk's hypothesis
- On a hypercube coloring problem
- On the chromatic number of cube-like graphs
- On tension-continuous mappings
- Circuit preserving edge maps. II
- Ball packings with high chromatic numbers from strongly regular graphs
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)