What people are saying - Write a review
We haven't found any reviews in the usual places.
K Kuratowski translated by J Jaworowski
G S Bloom J W Kennedy and L V Quintas
4 other sections not shown
2-connected adjacent algorithm belong BHM-graph bichromaticity called characterization chromatic number circuit complete bipartite graph consider contains COROLLARY cotree critical with respect crossing number cubic graphs cycle DDS(G defined denote digraph digraph G directed graph discatenable disjoint Distance Degree Sequence distribution domatic domatic number dual edge-disjoint elements embedding exists exterior Figure finite G has exactly giant component graph G Graph Theory Halin graph hamiltonian Harary Hence homeomorphic hypergraph induced subgraph integer isomorphic J.W. Kennedy kernel Kuratowski labyrinth Lemma Let G Math Mathematics matrix matroid negative natural automorphism number of vertices obtain outerplanar graphs pair partition Path Degree Sequence planar graphs plane points positive natural automorphism problem PROPOSITION prove random graphs rectangle regular graphs satisfying set of vertices simple closed curve square subgraph homeomorphic subsets symmetric game total graph transition tree vertex of degree vertex set vertices of G weakly acyclic Wroclaw Zielona