We show that the line graph of any balanced hypergraph is neighbourhood-perfect. This result is a hypergraphic extension of a recent theorem in [GKLM] saying that the line graphs of bipartite graphs are neighbourhood-perfect. The note contains also a graphical extension of the same theorem: the characterization of all graphs with neighbourhood-perfect line graph. The proof relies on a characterization of neighbourhood-perfect graphs among line graphs in terms of forbidden induced subgraphs.
KeywordsBipartite Graph Line Graph Maximal Clique Neighbourhood Graph Perfect Graph
Unable to display preview. Download preview PDF.
- 1.Berge, Graphs and Hypergraphs, North Holland, 1973Google Scholar
- 2.Gyárfás, ?., Kratsch, D., Lehel, J., Maffray, F.; Minimal non-neighbourhood-perfect graphs (submitted)Google Scholar
- 4.Maffray, F.; Kernels in perfect line-graphs. J. Comb. Theory 55 (1992)Google Scholar
- 5.Neeralagi, P.S., Sampathkumar, E.; The neighbourhood number of a graph (manuscript, 1984)Google Scholar