Set labelling vertices to ensure adjacency coincides with disjointness

DOI10.1016/j.endm.2017.11.019zbMath1383.05280arXiv1602.04076OpenAlexW2772122349MaRDI QIDQ2413366

Rahul Muthu, Mahipal Jadeja, V. Sunitha

Publication date: 10 April 2018

Full work available at URL: https://arxiv.org/abs/1602.04076

zbMATH Keywords

intersection graphsintersection numberKneser graphsvertex labellingset labelling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Covering graphs by the minimum number of equivalence relations
• More odd graph theory
• The multichromatic numbers of some Kneser graphs
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• Crossing Number is NP-Complete
• Topics in Intersection Graph Theory
• The Representation of a Graph by Set Intersections