Revision #2935 → #3420 · back to history
modifiedDirected graph7f720204ad7d
| Field | From #2935 | To #3420 |
|---|
| note | Directed graphs are formalized directly as Digraph (structurally equivalent to Quiver.{0}) in Mathlib.Combinatorics.Digraph.Basic. | Directed graphs are formalized directly as Digraph in Mathlib.Combinatorics.Digraph.Basic. |
modifiedHamiltonian path problemd2c6cfd91cc2
| Field | From #2935 | To #3420 |
|---|
| note | Hamiltonian walks (SimpleGraph.Walk.IsHamiltonian) and Hamiltonian graphs (SimpleGraph.IsHamiltonian) are defined, but the computational decision problem is not addressed. | Hamiltonian walks and Hamiltonian graphs (SimpleGraph.IsHamiltonian) are defined, but the computational decision problem is not addressed. |
addedEndpoints6f43687a829c
addedSimple graph84292f78b359
addedCayley graph87654b4c81ca
addedComplete graph1aa924dc99bb
addedComplete bipartite graphfd482fd1d6ca
addedDegree of a vertex8b1adb02fab5
addedSymmetric graph12fb49cd7560
addedVertex-transitive graphe13cfec118f3
addedEdge-transitive graphc7acfbcf0529
addedDistance-transitive graphc5205bccfb3c
addedDistance-regular graph2b95e7bb53d8
addedStrongly regular graph772b476810a1
addedGraph automorphism group62abdb51eeff
addedSubgraphc2e8b6c7a830
addedInduced subgraph120b58da414d
addedIndependent set1680bc3f76b7
addedCycle (graph theory)f85d2c18bfb4
addedMatching003cfb4bf652
addedConnected graphaae0b99c834e