Title of article
Generalized octahedra and cliques in intersection graphs of uniform hypergraphs Original Research Article
Author/Authors
Erich Prisner، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
9
From page
187
To page
195
Abstract
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
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
950933
Link To Document