Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6722305> ?p ?o }
Showing triples 1 to 29 of
29
with 100 triples per page.
- Q6722305 subject Q7007191.
- Q6722305 subject Q8234736.
- Q6722305 abstract "In graph theory, Mac Lane's planarity criterion is a characterisation of planar graphs in terms of their cycle spaces, named after Saunders Mac Lane, who published it in 1937. It states that a finite undirected graph is planar if and only if the cycle space of the graph (taken modulo 2) has a cycle basis in which each edge of the graph participates in at most two basis vectors.".
- Q6722305 wikiPageExternalLink fm2814.pdf.
- Q6722305 wikiPageWikiLink Q1087987.
- Q6722305 wikiPageWikiLink Q131476.
- Q6722305 wikiPageWikiLink Q141488.
- Q6722305 wikiPageWikiLink Q16766188.
- Q6722305 wikiPageWikiLink Q212803.
- Q6722305 wikiPageWikiLink Q27670.
- Q6722305 wikiPageWikiLink Q2902363.
- Q6722305 wikiPageWikiLink Q441223.
- Q6722305 wikiPageWikiLink Q45715.
- Q6722305 wikiPageWikiLink Q5121616.
- Q6722305 wikiPageWikiLink Q5198175.
- Q6722305 wikiPageWikiLink Q5467387.
- Q6722305 wikiPageWikiLink Q547823.
- Q6722305 wikiPageWikiLink Q603880.
- Q6722305 wikiPageWikiLink Q7007191.
- Q6722305 wikiPageWikiLink Q7168701.
- Q6722305 wikiPageWikiLink Q7390263.
- Q6722305 wikiPageWikiLink Q7959587.
- Q6722305 wikiPageWikiLink Q8234736.
- Q6722305 wikiPageWikiLink Q831672.
- Q6722305 wikiPageWikiLink Q852973.
- Q6722305 wikiPageWikiLink Q905837.
- Q6722305 wikiPageWikiLink Q913598.
- Q6722305 comment "In graph theory, Mac Lane's planarity criterion is a characterisation of planar graphs in terms of their cycle spaces, named after Saunders Mac Lane, who published it in 1937. It states that a finite undirected graph is planar if and only if the cycle space of the graph (taken modulo 2) has a cycle basis in which each edge of the graph participates in at most two basis vectors.".
- Q6722305 label "Mac Lane's planarity criterion".