<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>book chapter</genre>

<titleInfo><title>Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs</title></titleInfo>


<note type="publicationStatus">published</note>



<name type="personal">
  <namePart type="given">Burkhard</namePart>
  <namePart type="family">Monien</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Robert</namePart>
  <namePart type="family">Preis</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">101</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>









<originInfo><dateIssued encoding="w3cdtf">2007</dateIssued>
</originInfo>



<relatedItem type="host"><titleInfo><title>Mathematical Foundations of Computer Science 2001</title></titleInfo>
  <identifier type="issn">0302-9743</identifier>
  <identifier type="isbn">9783540424963</identifier>
  <identifier type="isbn">9783540446835</identifier><identifier type="doi">10.1007/3-540-44683-4_46</identifier>
<part>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<chicago>Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” In &lt;i&gt;Mathematical Foundations of Computer Science 2001&lt;/i&gt;. Berlin, Heidelberg, 2007. &lt;a href=&quot;https://doi.org/10.1007/3-540-44683-4_46&quot;&gt;https://doi.org/10.1007/3-540-44683-4_46&lt;/a&gt;.</chicago>
<short>B. Monien, R. Preis, in: Mathematical Foundations of Computer Science 2001, Berlin, Heidelberg, 2007.</short>
<apa>Monien, B., &amp;#38; Preis, R. (2007). Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In &lt;i&gt;Mathematical Foundations of Computer Science 2001&lt;/i&gt;. Berlin, Heidelberg. &lt;a href=&quot;https://doi.org/10.1007/3-540-44683-4_46&quot;&gt;https://doi.org/10.1007/3-540-44683-4_46&lt;/a&gt;</apa>
<ieee>B. Monien and R. Preis, “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs,” in &lt;i&gt;Mathematical Foundations of Computer Science 2001&lt;/i&gt;, Berlin, Heidelberg, 2007.</ieee>
<ama>Monien B, Preis R. Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In: &lt;i&gt;Mathematical Foundations of Computer Science 2001&lt;/i&gt;. Berlin, Heidelberg; 2007. doi:&lt;a href=&quot;https://doi.org/10.1007/3-540-44683-4_46&quot;&gt;10.1007/3-540-44683-4_46&lt;/a&gt;</ama>
<bibtex>@inbook{Monien_Preis_2007, place={Berlin, Heidelberg}, title={Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs}, DOI={&lt;a href=&quot;https://doi.org/10.1007/3-540-44683-4_46&quot;&gt;10.1007/3-540-44683-4_46&lt;/a&gt;}, booktitle={Mathematical Foundations of Computer Science 2001}, author={Monien, Burkhard and Preis, Robert}, year={2007} }</bibtex>
<mla>Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” &lt;i&gt;Mathematical Foundations of Computer Science 2001&lt;/i&gt;, 2007, doi:&lt;a href=&quot;https://doi.org/10.1007/3-540-44683-4_46&quot;&gt;10.1007/3-540-44683-4_46&lt;/a&gt;.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>16640</recordIdentifier><recordCreationDate encoding="w3cdtf">2020-04-16T08:58:07Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-01-06T06:52:53Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
