Contents

Ars Combinatoria

  • Research article

Enumerating Oriented Triangle Graphs

R.H. Jeurissen1, Th. Bezembinder2
1 Department of Mathematics University of Nijmegen Toernooiveld 6525 ED Nijmegen The Netherlands
2Nijmegen Institute for Cognition and Information University of Nijmegen P.O.Box 9104 6500 HE Nijmegen The Netherlands
  • Published: 30/04/1996

Abstract

With Burnside’s lemma as the main tool, we derive a formula for the number of oriented triangle graphs and for the number of such graphs in which all largest cliques are transitively oriented.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
R.H. Jeurissen, Th. Bezembinder. Enumerating Oriented Triangle Graphs[J], Ars Combinatoria, Volume 042. 151-160. DOI: .