Skip to main content
SpringerLink
Log in

Minimal asymmetric graphs of induced length 4

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Continuing the program, which was started in [4], of determining all minimal asymmetric graphs, it is shown that there are exactly seven finite minimal asymmetric graphs of induced length 4, and that these are at the same time the only finite minimal involution-free graphs of induced length 4. Contrary to the situation for minimal asymmetric/involution-free graphs of induced length >4, the assumption of finiteness is essential.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aschbacher, M. (1976): A homomorphism theorem for finite graphs.Proc. Amer. Math. Soc. 54, 468–470

    MATH  MathSciNet  Google Scholar 

  2. Blass, A. (1976): Graphs with unique maximal clumpings.J. Graph Theory 2, 19–24.

    MathSciNet  Google Scholar 

  3. Sabidussi, G. (1989): Paths in bipartite graphs with colour-inverting involutions.J. Graph Theory 13, 157–174

    MATH  MathSciNet  Google Scholar 

  4. Sabidussi, G. (1991): Clumps, minimal asymmetric graphs, and involutions.J. Combin. Theory B 53, 40–79

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KAM Department of Applied Mathematics, Charles University Prague, Czechoslovakia

    Jaroslav Nešetřil

  2. Institut für Diskrete Mathematik, Bonn, Germany

    Jaroslav Nešetřil

  3. Département de mathématiques et de statistique, Université de Montréal, C.P. 6128, Succ. A, H3C 3J7, Montréal, Québec, Canada

    Gert Sabidussi

Authors
  1. Jaroslav Nešetřil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gert Sabidussi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nešetřil, J., Sabidussi, G. Minimal asymmetric graphs of induced length 4. Graphs and Combinatorics 8, 343–359 (1992). https://doi.org/10.1007/BF02351591

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02351591

Keywords

Search

Navigation