Kneser Representations of Graphs

DOI10.1137/080722898zbMath1191.05068OpenAlexW1978547731MaRDI QIDQ3563960

Peter Hamburger, Attila Pór, Matt Walsh

Publication date: 1 June 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/99a79bb4b71d74b476b6ed535211af91d17adafe

zbMATH Keywords

graph representationsset systems

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Local Clique Covering of Claw-Free Graphs ⋮ On the unitary Cayley graphs of matrix algebras ⋮ Biclique cover and local clique cover of graphs ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Kneser Ranks of Random Graphs and Minimum Difference Representations ⋮ On compact symmetric regularizations of graphs

This page was built for publication: Kneser Representations of Graphs