On the recognition of bipolarizable and -simplicial graphs.
Nikolopoulos, Stavros D., Palios, Leonidas (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
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.
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 “Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs.”
On the recognition of bipolarizable and -simplicial graphs.
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
Graph connectivity and Wiener index
I. Gutman, S. Zhang (2006)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Note on seed graphs with components of given order.
Fronček, D. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
How to find overfull subgraphs in graphs with large maximum degree. II.
Niessen, Thomas (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Non-(p−1)-Partite Kp-Free Graphs
Kinnari Amin, Jill Faudree, Ronald J. Gould, Elżbieta Sidorowicz (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We say that a graph G is maximal Kp-free if G does not contain Kp but if we add any new edge e ∈ E(G) to G, then the graph G + e contains Kp. We study the minimum and maximum size of non-(p − 1)-partite maximal Kp-free graphs with n vertices. We also answer the interpolation question: for which values of n and m are there any n-vertex maximal Kp-free graphs of size m?
An efficient -centroid location algorithm for cographs.
Prakash, V. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Independence number of 2-factor-plus-triangles graphs.
Vandenbussche, Jennifer, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Finding a minimum dominating set by transforming domination of vertices.
Saoud, Mahmoud, Jebran, Jebran (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity: