Colouring without colours: graphs and matroids

MaRDI QIDQ3384048zbMATH OpenFDO

Authors

Publication date 16 December 2021

Full work available at URL https://www.lms.ac.uk/sites/lms.ac.uk/files/files/NLMS_482_reduced.pdf#reftaskno.9

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 4134067
• A geometric theory of hypergraph colouring
• scientific article; zbMATH DE number 821271
• scientific article; zbMATH DE number 25263
• scientific article; zbMATH DE number 446487

Cited in

(2)

• From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
• From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces.

This page was built for publication: Colouring without colours: graphs and matroids

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