About: Heawood graph

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Heawood graph Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatRegularGraphs, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FHeawood_graph&invfp=IFP_OFF&sas=SAME_AS_OFF

In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood.

Attributes	Values
rdf:type	software yago:Abstraction100002137 yago:Communication100033020 yago:Graph107000195 yago:WikicatIndividualGraphs yago:VisualCommunication106873252 yago:WikicatRegularGraphs
rdfs:label	Heawoodův graf (cs) Heawood-Graph (de) Grafo de Heawood (es) Heawood graph (en) Graphe de Heawood (fr) Grafo di Heawood (it) ヒーウッドグラフ (ja) Grafo de Heawood (pt) Граф Хивуда (ru) Граф Хівуда (uk)
rdfs:comment	Heawoodův graf je neorientovaný graf o 14 vrcholech a 21 hranách, známý z teorie grafů.Každý vrchol je spojen třemi hranami a všechny cykly v grafu mají šest nebo více hran. Heawoodův graf je pojmenován po britském matematikovi jménem Percy John Heawood, který v roce 1890 dokázal, že každé rozdělení tóru do polygonů může být obarveno nejvýše sedmi barvami. Heawoodův graf tvoří rozdělení tóru na sedm vzájemně propojených oblastí, čímž dokázal, že tato hranice je těsná. Jedná se o toroidní graf. (cs) In der Mathematik ist der Heawood-Graph ein Graph mit 14 Knoten und 21 Kanten, der unter anderem als Inzidenzgraph der Fano-Ebene von Bedeutung ist. Er ist nach Percy Heawood benannt. (de) In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood. (en) En el campo matemático de la teoría de grafos, el grafo de Heawood es un grafo no dirigido con 14 vértices y 21 aristas, nombrado en honor de . (es) En théorie des graphes, le graphe de Heawood est un graphe cubique symétrique possédant 14 sommets et 21 arêtes. Il doit son nom à Percy John Heawood, un mathématicien britannique né en 1861 et mort en 1955. (fr) Nel campo matematico della teoria dei grafi, il grafo di Heawood è un grafo non orientato con 14 vertici e 21 spigoli, che prende nome da Percy John Heawood. (it) 数学のグラフ理論の分野におけるヒーウッドグラフ（英: Heawood graph）は、の名にちなむ、14の頂点と21の辺を含むある無向グラフである。 (ja) Граф Хивуда — ненаправленный граф с 14 вершинами и 21 ребром, названый в честь Перси Джона Хивуда. (ru) Граф Хівуда — ненаправлений граф з 14 вершинами і 21 ребром, названий на честь . (uk) No campo da matemática da teoria dos grafos o grafo de Heawood é um grafo não-orientado com 14 vértices e 21 arestas. O grafo é cúbico, e todos os ciclos do grafo têm seis ou mais arestas. Todos os menores grafos cúbicos têm ciclos mais curtos, de modo que este grafo é o -6, o menor grafo cúbico de cintura 6. É também o do , o grafo que representa a incidência entre os pontos e linhas nesta geometria. É um grafo distância-regular; o seu grupo de simetrias é PGL2(7). O grafo de Heawood é um . (pt)
name	Heawood graph (en)
foaf:depiction
dcterms:subject	Individual graphs Regular graphs
Wikipage page ID	1396870 (xsd:integer)
Wikipage revision ID	1083976113 (xsd:integer)
Link from a Wikipage to another Wikipage	Queue number Percy John Heawood Perfect matching Characteristic polynomial Cubic graph Undirected graph Unit distance graph Levi graph Individual graphs Regular graphs Crossing number (graph theory) Mathematics Chromatic number Girth (graph theory) Cage (graph theory) Periodic boundary conditions Torus Distance-regular graph Distance-transitive graph Edge coloring Euclidean space Fano plane Graph embedding Graph theory Projective linear group Hamiltonian graph Coxeter graph Bipartite graph Symmetric graph Szilassi polyhedron Colin de Verdière graph invariant Toroidal graph Triangle Automorphism group Chromatic index Book thickness Foster census GL(3,2) Tits building Hamiltonian cycle dbr:File:Heawood_graph_on_torus.webm
sameAs	Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph Heawood graph

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software