<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
<channel rdf:about="http://hdl.handle.net/123456789/7165">
<title>CS309 Graph theory and combinatorics</title>
<link>http://hdl.handle.net/123456789/7165</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://hdl.handle.net/123456789/8491"/>
<rdf:li rdf:resource="http://hdl.handle.net/123456789/8489"/>
<rdf:li rdf:resource="http://hdl.handle.net/123456789/8482"/>
<rdf:li rdf:resource="http://hdl.handle.net/123456789/7170"/>
</rdf:Seq>
</items>
<dc:date>2026-04-06T01:46:33Z</dc:date>
</channel>
<item rdf:about="http://hdl.handle.net/123456789/8491">
<title>Graph theory and combinatorics 2021</title>
<link>http://hdl.handle.net/123456789/8491</link>
<description>Graph theory and combinatorics 2021
</description>
<dc:date>2021-12-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/123456789/8489">
<title>Graph theory and combinatorics 2020</title>
<link>http://hdl.handle.net/123456789/8489</link>
<description>Graph theory and combinatorics 2020
</description>
<dc:date>2020-12-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/123456789/8482">
<title>Graph theory and combinatorics 2019</title>
<link>http://hdl.handle.net/123456789/8482</link>
<description>Graph theory and combinatorics 2019
</description>
<dc:date>2019-12-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/123456789/7170">
<title>Graph theory and combinatorics 2018</title>
<link>http://hdl.handle.net/123456789/7170</link>
<description>Graph theory and combinatorics 2018
</description>
<dc:date>2018-12-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
