Bounds of eigenvalues of -minor free graphs.

In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not.

Homomorphisms of complete n-partite graphs.

Girse, Robert D. (1986)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Planarizing graphs---a survey and annotated bibliography.

Liebers, Annegret (2001)

Journal of Graph Algorithms and Applications

Similarity:

Displaying similar documents to “Bounds of eigenvalues of K 3 , 3 -minor free graphs.”

Maximal Graphs with Given Connectivity and Edge-Connectivity

Bipartite diametrical graphs of diameter 4 and extreme orders.

Upper and lower bounds for F v ( 4 , 4 ; 5 ) .

A linear algorithm to recognize maximal generalized outerplanar graphs

Homomorphisms of complete n-partite graphs.

Planarizing graphs---a survey and annotated bibliography.

Displaying similar documents to “Bounds of eigenvalues of $K_{3, 3}$ -minor free graphs.”

Upper and lower bounds for $F_{v} (4, 4; 5)$ .