Pancyclic graph
In the mathematical study of graph theory, a pancyclic graph is a directed graph or undirected graph that contains cycles of all possible lengths from three up to the number of vertices in the graph. Pancyclic graphs are a generalization of Hamiltonian graphs, graphs which have a cycle of the maximum possible length.
properties
primaryTopic
Pancyclic graph
In the mathematical study of graph theory, a pancyclic graph is a directed graph or undirected graph that contains cycles of all possible lengths from three up to the number of vertices in the graph. Pancyclic graphs are a generalization of Hamiltonian graphs, graphs which have a cycle of the maximum possible length.
has abstract
In the mathematical study of g ...... f the maximum possible length.
@en
Панциклический граф — ориентир ...... максимальной возможной длины.
@ru
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
28,691,490
Wikipage revision ID
738,898,453
title
Pancyclic Graph
urlname
PancyclicGraph
hypernym
type
comment
In the mathematical study of g ...... f the maximum possible length.
@en
Панциклический граф — ориентир ...... максимальной возможной длины.
@ru
label
Pancyclic graph
@en
Панциклический граф
@ru
