Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/0012-365x(90)90251-c> ?p ?o }
Showing triples 1 to 13 of
13
with 100 triples per page.
- 0012-365x(90)90251-c doi "10.1016/0012-365X90251-C".
- 0012-365x(90)90251-c first1 "Matthias".
- 0012-365x(90)90251-c first2 "Frank".
- 0012-365x(90)90251-c isCitedBy Greedy_coloring.
- 0012-365x(90)90251-c isCitedBy Perfectly_orderable_graph.
- 0012-365x(90)90251-c issue "3".
- 0012-365x(90)90251-c journal Discrete_Mathematics_(journal).
- 0012-365x(90)90251-c last1 "Middendorf".
- 0012-365x(90)90251-c last2 "Pfeiffer".
- 0012-365x(90)90251-c pages "327–333".
- 0012-365x(90)90251-c title "On the complexity of recognizing perfectly orderable graphs".
- 0012-365x(90)90251-c volume "80".
- 0012-365x(90)90251-c year "1990".