Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5155607> ?p ?o }
Showing triples 1 to 49 of
49
with 100 triples per page.
- Q5155607 subject Q7007192.
- Q5155607 subject Q7217193.
- Q5155607 subject Q7452041.
- Q5155607 abstract "In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, and containment graphs.An incomparability graph is an undirected graph that connects pairs of elements that are not comparable to each other in a partial order.".
- Q5155607 thumbnail Poset_et_graphe_de_comparabilité.svg?width=300.
- Q5155607 wikiPageExternalLink pds.pdf.
- Q5155607 wikiPageExternalLink stringpartial071709.pdf.
- Q5155607 wikiPageWikiLink Q1049914.
- Q5155607 wikiPageWikiLink Q1060343.
- Q5155607 wikiPageWikiLink Q1134776.
- Q5155607 wikiPageWikiLink Q1137726.
- Q5155607 wikiPageWikiLink Q1187620.
- Q5155607 wikiPageWikiLink Q1195339.
- Q5155607 wikiPageWikiLink Q131476.
- Q5155607 wikiPageWikiLink Q141488.
- Q5155607 wikiPageWikiLink Q1501387.
- Q5155607 wikiPageWikiLink Q166507.
- Q5155607 wikiPageWikiLink Q17148818.
- Q5155607 wikiPageWikiLink Q174733.
- Q5155607 wikiPageWikiLink Q2667573.
- Q5155607 wikiPageWikiLink Q272735.
- Q5155607 wikiPageWikiLink Q369377.
- Q5155607 wikiPageWikiLink Q45715.
- Q5155607 wikiPageWikiLink Q474715.
- Q5155607 wikiPageWikiLink Q504843.
- Q5155607 wikiPageWikiLink Q5141281.
- Q5155607 wikiPageWikiLink Q5155608.
- Q5155607 wikiPageWikiLink Q5467387.
- Q5155607 wikiPageWikiLink Q5601715.
- Q5155607 wikiPageWikiLink Q6057290.
- Q5155607 wikiPageWikiLink Q6097339.
- Q5155607 wikiPageWikiLink Q64861.
- Q5155607 wikiPageWikiLink Q6874717.
- Q5155607 wikiPageWikiLink Q7007192.
- Q5155607 wikiPageWikiLink Q7102401.
- Q5155607 wikiPageWikiLink Q7169369.
- Q5155607 wikiPageWikiLink Q7217193.
- Q5155607 wikiPageWikiLink Q7452041.
- Q5155607 wikiPageWikiLink Q7454786.
- Q5155607 wikiPageWikiLink Q753127.
- Q5155607 wikiPageWikiLink Q7534804.
- Q5155607 wikiPageWikiLink Q7623978.
- Q5155607 wikiPageWikiLink Q7844666.
- Q5155607 wikiPageWikiLink Q835942.
- Q5155607 wikiPageWikiLink Q902252.
- Q5155607 wikiPageWikiLink Q943345.
- Q5155607 comment "In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, and containment graphs.An incomparability graph is an undirected graph that connects pairs of elements that are not comparable to each other in a partial order.".
- Q5155607 label "Comparability graph".
- Q5155607 depiction Poset_et_graphe_de_comparabilité.svg.