Herschel graph
In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges, the smallest non-Hamiltonian polyhedral graph. It is named after British astronomer Alexander Stewart Herschel.
Wikipage disambiguates
primaryTopic
Herschel graph
In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges, the smallest non-Hamiltonian polyhedral graph. It is named after British astronomer Alexander Stewart Herschel.
has abstract
In graph theory, a branch of m ...... er Alexander Stewart Herschel.
@en
Le graphe de Herschel est, en ...... édant 11 sommets et 18 arêtes.
@fr
В теории графов граф Хершеля — ...... , и не описывает граф Хершеля.
@ru
Wikipage page ID
24,670,148
page length (characters) of wiki page
Wikipage revision ID
1,021,982,504
Link from a Wikipage to another Wikipage
automorphisms
chromatic index
chromatic number
image caption
The Herschel graph.
@en
mode
cs2
@en
name
Herschel graph
@en
namesake
title
Herschel Graph
@en
urlname
HerschelGraph
@en
vertices
wikiPageUsesTemplate
hypernym
type
comment
In graph theory, a branch of m ...... er Alexander Stewart Herschel.
@en
Le graphe de Herschel est, en ...... édant 11 sommets et 18 arêtes.
@fr
В теории графов граф Хершеля — ...... , и не описывает граф Хершеля.
@ru
label
Graphe de Herschel
@fr
Herschel graph
@en
Граф Хершеля
@ru