Recognizing the -structure of claw-free graphs and a larger graph class.
Babel, Luitpold, Brandstädt, Andreas, Le, Van Bang (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Displaying similar documents to “The perfection and recognition of bull-reducible Berge graphs”
Recognizing the -structure of claw-free graphs and a larger graph class.
Matchings in infinite graphs
P. J. McCarthy (1978)
Czechoslovak Mathematical Journal
Similarity:
Gallai and anti-Gallai graphs of a graph
Aparna Lakshmanan S., S. B. Rao, A. Vijayakumar (2007)
Mathematica Bohemica
Similarity:
The paper deals with graph operators—the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs and the anti-Gallai graphs to be -free for any finite graph . The case of complement reducible graphs—cographs is discussed in detail. Some relations between the chromatic number, the radius and the diameter of a graph and its Gallai and anti-Gallai graphs are also obtained.
Factors of claw-free graphs
Zbigniew Lonc, Zdeněk Ryjáček (1991)
Czechoslovak Mathematical Journal
Similarity:
On a quasiordering of bipartite graphs.
Gutman, Ivan, Fuji, Zhang (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: