Generalized octahedra and cliques in intersection graphs of uniform hypergraphs Original Research Article

Vizingʹs adjacency lemma describes an important property of edge-chromatic critical graphs. In an edge-chromatic critical simple graph G of maximum degree Δ, if xy is an edge then x is adjacent with at least Δ−deg(y)+1 vertices (≠y) of degree Δ. In this p