• TOC
  • Courses
  • Blog
  • Shop
  • Search
    • Courses
    • Blog
    • Subreddit
    • Discord
    • Log in
    • Sign up
    • ▾Graph theory
      • •Matchings
      • •Minimum spanning tree
      • •Automorphisms of a graph
      • •Tournament graphs
      • ▾Basics of graph theory
        • •Intro to graphs
        • •Isomorphic graphs
        • •Walks, paths, and cycles
        • •Connected graphs
        • •Adjacency and degrees
        • •Subgraphs
        • •Graph components
        • •Adjacency lists, adjacency matrices, and incidence matrices
        • •Other simple planar graphs
        • •Regular graphs
      • •Intro to bipartite graphs
      • ▸Paths and cycles
        • ▸Eulerian cycles and paths
          • •Intro
          • •Using the theorem
        • •Hamiltonian cycles and paths
      • •Planar graphs
      • ▸Coloring
        • •Intro to vertex colorings
      • •Dijkstra's algorithm
      • •Fleury's algorithm
      • •Flows and cuts
      • •Kruskal's algorithm
      • •Minimum vertex covers
      • •Number of edges in a complete graph
      • •Perfect graph
      • •Size of tree is one less than order
      • ▸Trees
        • •Intro to trees
        • •Proving properties of trees
      • •Utilities puzzle
      • •What is a complete graph?
      • •What is a cubic graph?
      • •What is a maximal clique?
      • •What is an edge-induced subgraph?
      • •What is an irregular graph?
      • •What is a spanning subgraph?
      • •What is a vertex-induced subgraph?
      • •Intro to digraphs
      • •Combinatorics and graph theory
      • •Graceful labeling
     › Graph theory › Basics of graph theory

    Walks, paths, and cycles

    In this lesson, you'll learn what walks, paths, and cycles are.

    Watch these videos:

    3675What is a Walk? | Graph Theory
    Wrath of Math
    3548What is a Path? | Graph Theory
    Wrath of Math
    3794What is a Graph Cycle? | Graph Theory, Cycles, Cyclic Graphs, Simple Cycles
    Wrath of Math