On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles.
Chia, Gek Ling, Ho, Chee-Kit (2003)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Displaying similar documents to “Some constructions of -minimal graphs”
On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles.
Graphs with maximum and minimum independence numbers.
Gutman, Ivan (1983)
Publications de l'Institut Mathématique. Nouvelle Série
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.
Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete.
Abbas, N., Culberson, J., Stewart, L. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Induced complete -partite graphs in dense clique-less graphs.
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A survey of the algorithmic properties of simplicial, upper bound and middle graphs.
Cheston, Grant A., Jap, Tjoen Seng (2006)
Journal of Graph Algorithms and Applications
Similarity: