Fixing subgraphs of Km,n

  • Keith Chidzey
Contributed Papers
Part of the Lecture Notes in Mathematics book series (LNM, volume 686)


We characterise the fixing subgraphs of complete bipartite graphs Km,n and study various aspects of those which are minimal. These minimal fixing subgraphs are necessarily forests. In particular, we show that any given tree with parts of unequal size is a component of a minimal fixing subgraph of some Km,n.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Sheehan, "Fixing subgraphs", J. Comb. Th., (B), 12 (1972), 226–244.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1978

Authors and Affiliations

  • Keith Chidzey
    • 1
  1. 1.Department of MathematicsUniversity of MelbourneParkvilleAustralia

Personalised recommendations