On graphs with isomorphic, non-isomorphic and connected -neighbourhoods
Zdeněk Ryjáček (1987)
Časopis pro pěstování matematiky
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Locally graphs.”
On graphs with isomorphic, non-isomorphic and connected -neighbourhoods
Randomly complete -partite graphs
Yousef Alavi, Don R. Lick, Song Lin Tian (1989)
Mathematica Slovaca
Similarity:
The perfection and recognition of bull-reducible Berge graphs
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce Reed (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The recently announced Strong Perfect Graph Theorem states that the class of perfect graphs coincides with the class of graphs containing no induced odd cycle of length at least 5 or the complement of such a cycle. A graph in this second class is called Berge. A bull is a graph with five vertices and five edges . A graph is bull-reducible if no vertex is in two bulls. In this paper we give a simple proof that every bull-reducible Berge graph is perfect. Although this result follows...
Graphs with nonisomorphic vertex neighbourhoods of the first and second types
Zdeněk Ryjáček (1987)
Časopis pro pěstování matematiky
Similarity: