<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-05-30T21:11:20Z</responseDate>
  <request verb="GetRecord" identifier="oai:meral.edu.mm:recid/00008431" metadataPrefix="oai_dc">https://meral.edu.mm/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:meral.edu.mm:recid/00008431</identifier>
        <datestamp>2022-12-01T08:57:26Z</datestamp>
        <setSpec>1582963788001:1582966516414</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Arc-Disjoint Paths and Internally Disjoint Paths in a Digraph</dc:title>
          <dc:creator>Myo San Oo</dc:creator>
          <dc:creator>Swe Zin New</dc:creator>
          <dc:description>"In this paper, some basic definitions and notations on digraphs are introduced. Some basic
concepts on strong connectivity are discussed. Finally, the fundamental theorem concerning
with arc-disjoint paths and internally-disjoint paths is studied with illustrated examples."</dc:description>
          <dc:identifier>https://meral.edu.mm/records/8431</dc:identifier>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
