Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3115604> ?p ?o }
Showing triples 1 to 80 of
80
with 100 triples per page.
- Q3115604 subject Q7007191.
- Q3115604 subject Q7217193.
- Q3115604 abstract "In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing.Outerplanar graphs may be characterized (analogously to Wagner's theorem for planar graphs) by the two forbidden minors K4 and K2,3, or by their Colin de Verdière graph invariants.They have Hamiltonian cycles if and only if they are biconnected, in which case the outer face forms the unique Hamiltonian cycle. Every outerplanar graph is 3-colorable, and has degeneracy and treewidth at most 2.The outerplanar graphs are a subset of the planar graphs, the subgraphs of series-parallel graphs, and the circle graphs. The maximal outerplanar graphs, those two which no more edges can be added while preserving outerplanarity, are also chordal graphs and visibility graphs.".
- Q3115604 thumbnail Triangulation_3-coloring.svg?width=300.
- Q3115604 wikiPageExternalLink item?id=AIHPB_1967__3_4_433_0.
- Q3115604 wikiPageExternalLink p1082.
- Q3115604 wikiPageExternalLink gc_110.html.
- Q3115604 wikiPageExternalLink index.html.
- Q3115604 wikiPageWikiLink Q1050972.
- Q3115604 wikiPageWikiLink Q1065144.
- Q3115604 wikiPageWikiLink Q1191214.
- Q3115604 wikiPageWikiLink Q12027616.
- Q3115604 wikiPageWikiLink Q131476.
- Q3115604 wikiPageWikiLink Q1322892.
- Q3115604 wikiPageWikiLink Q1384912.
- Q3115604 wikiPageWikiLink Q141488.
- Q3115604 wikiPageWikiLink Q1699014.
- Q3115604 wikiPageWikiLink Q1709878.
- Q3115604 wikiPageWikiLink Q19358233.
- Q3115604 wikiPageWikiLink Q2000090.
- Q3115604 wikiPageWikiLink Q201492.
- Q3115604 wikiPageWikiLink Q215206.
- Q3115604 wikiPageWikiLink Q21578.
- Q3115604 wikiPageWikiLink Q222032.
- Q3115604 wikiPageWikiLink Q2226822.
- Q3115604 wikiPageWikiLink Q2294516.
- Q3115604 wikiPageWikiLink Q2300244.
- Q3115604 wikiPageWikiLink Q2393193.
- Q3115604 wikiPageWikiLink Q245595.
- Q3115604 wikiPageWikiLink Q245673.
- Q3115604 wikiPageWikiLink Q266775.
- Q3115604 wikiPageWikiLink Q272735.
- Q3115604 wikiPageWikiLink Q273037.
- Q3115604 wikiPageWikiLink Q2780987.
- Q3115604 wikiPageWikiLink Q2913731.
- Q3115604 wikiPageWikiLink Q3045660.
- Q3115604 wikiPageWikiLink Q3113164.
- Q3115604 wikiPageWikiLink Q3115604.
- Q3115604 wikiPageWikiLink Q3186905.
- Q3115604 wikiPageWikiLink Q325904.
- Q3115604 wikiPageWikiLink Q3498041.
- Q3115604 wikiPageWikiLink Q380679.
- Q3115604 wikiPageWikiLink Q383444.
- Q3115604 wikiPageWikiLink Q4390447.
- Q3115604 wikiPageWikiLink Q45715.
- Q3115604 wikiPageWikiLink Q4796301.
- Q3115604 wikiPageWikiLink Q4951712.
- Q3115604 wikiPageWikiLink Q504843.
- Q3115604 wikiPageWikiLink Q5067368.
- Q3115604 wikiPageWikiLink Q5121450.
- Q3115604 wikiPageWikiLink Q5251771.
- Q3115604 wikiPageWikiLink Q5282038.
- Q3115604 wikiPageWikiLink Q5467387.
- Q3115604 wikiPageWikiLink Q547823.
- Q3115604 wikiPageWikiLink Q5532453.
- Q3115604 wikiPageWikiLink Q558339.
- Q3115604 wikiPageWikiLink Q5597085.
- Q3115604 wikiPageWikiLink Q5601715.
- Q3115604 wikiPageWikiLink Q5808319.
- Q3115604 wikiPageWikiLink Q584521.
- Q3115604 wikiPageWikiLink Q6051350.
- Q3115604 wikiPageWikiLink Q622506.
- Q3115604 wikiPageWikiLink Q6554389.
- Q3115604 wikiPageWikiLink Q7007191.
- Q3115604 wikiPageWikiLink Q7130424.
- Q3115604 wikiPageWikiLink Q7217193.
- Q3115604 wikiPageWikiLink Q7454787.
- Q3115604 wikiPageWikiLink Q7661892.
- Q3115604 wikiPageWikiLink Q782100.
- Q3115604 wikiPageWikiLink Q782746.
- Q3115604 wikiPageWikiLink Q7840044.
- Q3115604 wikiPageWikiLink Q7959587.
- Q3115604 wikiPageWikiLink Q8216024.
- Q3115604 wikiPageWikiLink Q837902.
- Q3115604 wikiPageWikiLink Q905837.
- Q3115604 wikiPageWikiLink Q913598.
- Q3115604 wikiPageWikiLink Q924044.
- Q3115604 comment "In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing.Outerplanar graphs may be characterized (analogously to Wagner's theorem for planar graphs) by the two forbidden minors K4 and K2,3, or by their Colin de Verdière graph invariants.They have Hamiltonian cycles if and only if they are biconnected, in which case the outer face forms the unique Hamiltonian cycle.".
- Q3115604 label "Outerplanar graph".
- Q3115604 depiction Triangulation_3-coloring.svg.