GoblinsCreate Account
Standards/Math/Virginia/DM.GT

DM.GT

DM Discrete Mathematics
DM.CM
DM.GT
DM.GT.1DM.GT.2DM.GT.3DM.GT.4DM.GT.5
DM.LR
DM.SNT

Graph Theory

DM.GT.1The student will represent problems using vertex-edge graphs. The concepts of degree, connectedness, paths, planarity, and directed graphs will be analyzed.DM.GT.2The student will solve problems through analysis and application of circuits, cycles, Euler paths, Euler circuits, Hamilton paths, and Hamilton circuits. Optimal solutions will be determined using existing algorithms and student-created algorithms.DM.GT.3The student will apply graphs to conflict-resolution problems, such as graph coloring, scheduling, matching, and optimization.DM.GT.4The student will recognize and apply algorithms to solve configuration, conflict resolution, and sorting problems.DM.GT.5The student will use algorithms to schedule tasks to determine a minimum project time.
Goblins

1-on-1 AI tutoring aligned to DM.GT. Instant help for students, real-time insights for teachers.

Used in classrooms by 100,000+ students at Baltimore County, Plano ISD, Deer Valley USD, KIPP, and districts nationwide.

Free for teachers, forever →

Resources

Privacy PolicyTerms of ServiceCareersTeacher LoginStudent Login

Communities

Access 4 Learning Community, Student Data Privacy Consortium
Goblins

© 2023-2026 Aha Moments, Inc.