INDEPENDENT SET and CLIQUE problems in intersection-defined classes of graphs
Jan Kratochvíl, Jaroslav Nešetřil (1990)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Jan Kratochvíl, Jaroslav Nešetřil (1990)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Jan Kratochvíl (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Chandran, L.Sunil, Lozin, Vadim V., Subramanian, C.R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Marián Klešč, Stefan Schrötter (2011)
Discussiones Mathematicae Graph Theory
Similarity:
Kulli and Muddebihal [V.R. Kulli, M.H. Muddebihal, Characterization of join graphs with crossing number zero, Far East J. Appl. Math. 5 (2001) 87-97] gave the characterization of all pairs of graphs which join product is planar graph. The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. There are only few results concerning crossing numbers of graphs obtained as join product of two graphs. In the paper, the exact values of crossing...
Oldřich John, Jan Malý, Jana Stará (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Yan Yang, Yichao Chen (2017)
Discussiones Mathematicae Graph Theory
Similarity:
The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study...
Akiyama, Jin, Harary, Frank (1979)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity: