Graphs with prescribed maximal subgraphs and critical chromatic graphs
Heinz‐Jürgen Voss · Czech digital mathematics library · 1977
It is proved that k-chromatic-critical graphs of large order contain large subgraphs of a certain structure.One of these results is that each large k-chromatic-critical graph contains a large odd circuit.A more general result is that if a large 2-connected graph G contains sub-.graphs of a certain structure of order N but not of order >N then G contains at least two dis.loAntisomorphic subgraphs not linked by an edge which are isomorphically"connected to the rest G -H^ -I.U by edges.A so-called p-reduction is studied for such graphs.Ke.