The question of whether there are infinitely many nonisomorphic critical nonstring graphs has been an open problem for some time. The main result of this paper ...
We have proved in [9], besides other results, that the smallest possible nonstring graph has 12 vertices and that complements of planar graphs are string graphs ...
The question of whether there are infinitely many nonisomorphic critical nonstring graphs has been an open problem for some time. The main result of this paper ...
People also ask
What is the infinite number on a graph?
What is a string graph?
String graphs. I. the number of critical nonstring graphs is infinite. Journal of Combinatorial. Theory, Series B, 52, 1991. [12] J. Kratochv l. String graphs.
Kratochvıl, String graphs. I. The number of critical nonstring graphs is infinite, J. Combin. Theory. Series B 52 (1991) 53–66. [Kra91b]. J. Kratochvıl ...
Kratochvil, Jan (1991a), "String Graphs. I. The number of critical nonstring graphs is infinite", Journal of Combinatorial Theory, Series B, 52 (1): 53–66, doi ...
String graphs. I. the number of critical nonstring graphs is infinite. Journal of Combinatorial Theory, Series B, 52, 1991.]] Digital Library · Google Scholar.
String graphs. I, The number of critical nonstring graphs is infinite
pascal-francis.inist.fr › vibad
String graphs. I, The number of critical nonstring graphs is infinite. Author: KRATOCHVIL, J Charles univ., fac. mathematics physics, dep. algebra, Prague 186 ...
String graphs. I. The number of critical nonstring graphs is infinite · Jan Kratochvíl. Mathematics. J. Comb. Theory B. 1991. 52 Citations · Highly Influential.
... String graphs I: the number of critical nonstring graphs is infinite, Journal of. Combinatorial Theory, Series B 52 (1991), 53–66. [27] J. Kratochv´ıl, String ...