Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/j.ejc.2007.06.020> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- j.ejc.2007.06.020 date "2005".
- j.ejc.2007.06.020 date "2008".
- j.ejc.2007.06.020 doi "10.1016/j.ejc.2007.06.020".
- j.ejc.2007.06.020 first "József".
- j.ejc.2007.06.020 first "Oleg V.".
- j.ejc.2007.06.020 first2 "Alexandr V.".
- j.ejc.2007.06.020 first2 "Martin".
- j.ejc.2007.06.020 first3 "András".
- j.ejc.2007.06.020 first3 "Naeem N.".
- j.ejc.2007.06.020 first4 "Gexin".
- j.ejc.2007.06.020 first4 "Xingxing".
- j.ejc.2007.06.020 isCitedBy (a,b)-decomposability.
- j.ejc.2007.06.020 issue "1".
- j.ejc.2007.06.020 issue "5".
- j.ejc.2007.06.020 journal "European Journal of Combinatorics".
- j.ejc.2007.06.020 journal "Journal of Combinatorial Theory, Series B".
- j.ejc.2007.06.020 last "Balogh".
- j.ejc.2007.06.020 last "Borodin".
- j.ejc.2007.06.020 last2 "Kochol".
- j.ejc.2007.06.020 last2 "Kostochka".
- j.ejc.2007.06.020 last3 "Pluhár".
- j.ejc.2007.06.020 last3 "Sheikh".
- j.ejc.2007.06.020 last4 "Yu".
- j.ejc.2007.06.020 pages "1235–1241".
- j.ejc.2007.06.020 pages "147–158".
- j.ejc.2007.06.020 title "Covering planar graphs with forests".
- j.ejc.2007.06.020 title "Decomposing a planar graph with girth 9 into a forest and a matching".
- j.ejc.2007.06.020 url S0095895604001273.
- j.ejc.2007.06.020 url S0195669807001151.
- j.ejc.2007.06.020 volume "29".
- j.ejc.2007.06.020 volume "94".