Matroidal bijections between graphs

DOI10.1016/0095-8956(88)90053-6zbMath0724.05067OpenAlexW2984474976MaRDI QIDQ2276983

Michael Tarsi, Nathan Linial, Roy Meshulam

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90053-6

zbMATH Keywords

cyclesgraphsbinary matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Designs and configurations (05B99)

Related Items (11)

BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ Homomorphisms from the torus ⋮ On tension-continuous mappings ⋮ Tension continuous maps -- their structure and applications ⋮ New results on two hypercube coloring problems ⋮ The chromatic number of the square of the $8$-cube ⋮ On the chromatic number of cube-like graphs ⋮ Ball packings with high chromatic numbers from strongly regular graphs ⋮ On a hypercube coloring problem ⋮ Exact distance graphs of product graphs ⋮ Around Borsuk's hypothesis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-duality and the cycle double cover conjecture
• Orientability of matroids
• Lower bounds for constant weight codes
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Matroidal bijections between graphs