🌱 garden

Search

SearchSearch

Recent Notes

  • GENB045 Математически анализ

    Apr 01, 2024

    • #fundamentals
    • #calculus
  • CSCB039 Алгоритми и програмиране

    Mar 31, 2024

    • #computer-science
    • #algorithms
  • CITB408 Програмиране на Java

    Mar 31, 2024

    • #fundamentals
    • #programming
    • #java
  • CITB408 Програмиране на Java

    Mar 31, 2024

    • #fundamentals
    • #programming
    • #python

Tournament

Oct 11, 2023, 1 min read

  • #graph-theory
  • #definition

A tournament is a directed graph obtained by assigning a direction for each edge in an undirected complete graph.

In every tournament there’s a Hamiltonian path.

Every strongly connected 1 tournament has a Hamiltonian cycle.

Footnotes §

  1. strongly connected: a graph is said to be strongly connected if every vertex is reachable from every other vertex ↩

Graph View

Backlinks

  • No backlinks found

Created with Quartz v4.1.0, © 2024

  • GitHub
  • Mastodon
  • SimplySuperb