Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Ljubljana_graph> ?p ?o }
Showing triples 1 to 69 of
69
with 100 triples per page.
- Ljubljana_graph abstract "In the mathematical field of graph theory, the Ljubljana graph is an undirected bipartite graph with 112 vertices and 168 edges.It is a cubic graph with diameter 8, radius 7, chromatic number 2 and chromatic index 3. Its girth is 10 and there are exactly 168 cycles of length 10 in it. There are also 168 cycles of length 12.".
- Ljubljana_graph thumbnail Ljubljana_graph_hamiltonian.svg?width=300.
- Ljubljana_graph wikiPageID "24131381".
- Ljubljana_graph wikiPageLength "4548".
- Ljubljana_graph wikiPageOutDegree "37".
- Ljubljana_graph wikiPageRevisionID "695430207".
- Ljubljana_graph wikiPageWikiLink 110-vertex_Iofinova-Ivanov_graph.
- Ljubljana_graph wikiPageWikiLink Andries_Brouwer.
- Ljubljana_graph wikiPageWikiLink Automorphism.
- Ljubljana_graph wikiPageWikiLink Bipartite_graph.
- Ljubljana_graph wikiPageWikiLink Carsten_Thomassen.
- Ljubljana_graph wikiPageWikiLink Category:Individual_graphs.
- Ljubljana_graph wikiPageWikiLink Category:Regular_graphs.
- Ljubljana_graph wikiPageWikiLink Cubic_graph.
- Ljubljana_graph wikiPageWikiLink Dejter_graph.
- Ljubljana_graph wikiPageWikiLink Dragan_Marušič.
- Ljubljana_graph wikiPageWikiLink Edge_coloring.
- Ljubljana_graph wikiPageWikiLink Graph_(discrete_mathematics).
- Ljubljana_graph wikiPageWikiLink Graph_automorphism.
- Ljubljana_graph wikiPageWikiLink Graph_coloring.
- Ljubljana_graph wikiPageWikiLink Graph_theory.
- Ljubljana_graph wikiPageWikiLink Gray_graph.
- Ljubljana_graph wikiPageWikiLink Hamiltonian_path.
- Ljubljana_graph wikiPageWikiLink Heawood_graph.
- Ljubljana_graph wikiPageWikiLink Italo_Jose_Dejter.
- Ljubljana_graph wikiPageWikiLink LCF_notation.
- Ljubljana_graph wikiPageWikiLink Levi_graph.
- Ljubljana_graph wikiPageWikiLink Ljubljana.
- Ljubljana_graph wikiPageWikiLink Marston_Conder.
- Ljubljana_graph wikiPageWikiLink Mathematics.
- Ljubljana_graph wikiPageWikiLink R._M._Foster.
- Ljubljana_graph wikiPageWikiLink Semi-symmetric_graph.
- Ljubljana_graph wikiPageWikiLink Slovenia.
- Ljubljana_graph wikiPageWikiLink Tomaž_Pisanski.
- Ljubljana_graph wikiPageWikiLink Vertex_(graph_theory).
- Ljubljana_graph wikiPageWikiLink File:Ljubljana_graph_hamiltonian.svg.
- Ljubljana_graph wikiPageWikiLinkText "Ljubljana graph".
- Ljubljana_graph automorphisms "168".
- Ljubljana_graph chromaticIndex "3".
- Ljubljana_graph chromaticNumber "2".
- Ljubljana_graph diameter "8".
- Ljubljana_graph edges "168".
- Ljubljana_graph girth "10".
- Ljubljana_graph imageCaption "The Ljubljana graph is hamiltonian.".
- Ljubljana_graph name "Ljubljana graph".
- Ljubljana_graph properties Cubic_graph.
- Ljubljana_graph properties Hamiltonian_path.
- Ljubljana_graph properties Semi-symmetric_graph.
- Ljubljana_graph radius "7".
- Ljubljana_graph vertices "112".
- Ljubljana_graph wikiPageUsesTemplate Template:Infobox_graph.
- Ljubljana_graph wikiPageUsesTemplate Template:Reflist.
- Ljubljana_graph subject Category:Individual_graphs.
- Ljubljana_graph subject Category:Regular_graphs.
- Ljubljana_graph hypernym Graph.
- Ljubljana_graph type Software.
- Ljubljana_graph type Graph.
- Ljubljana_graph comment "In the mathematical field of graph theory, the Ljubljana graph is an undirected bipartite graph with 112 vertices and 168 edges.It is a cubic graph with diameter 8, radius 7, chromatic number 2 and chromatic index 3. Its girth is 10 and there are exactly 168 cycles of length 10 in it. There are also 168 cycles of length 12.".
- Ljubljana_graph label "Ljubljana graph".
- Ljubljana_graph sameAs Q3034788.
- Ljubljana_graph sameAs Graphe_de_Ljubljana.
- Ljubljana_graph sameAs Grafo_de_Ljubljana.
- Ljubljana_graph sameAs m.07k8qp2.
- Ljubljana_graph sameAs Ljubljanski_graf.
- Ljubljana_graph sameAs Граф_Любляни.
- Ljubljana_graph sameAs Q3034788.
- Ljubljana_graph wasDerivedFrom Ljubljana_graph?oldid=695430207.
- Ljubljana_graph depiction Ljubljana_graph_hamiltonian.svg.
- Ljubljana_graph isPrimaryTopicOf Ljubljana_graph.