<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00972310</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-16T02:20:38+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Bounded-degree graphs have arbitrarily large queue-number</title>
            <author role="aut">
              <persName>
                <forename type="first">David R.</forename>
                <surname>Wood</surname>
              </persName>
              <idno type="halauthorid">606878-0</idno>
              <affiliation ref="#struct-18818"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Service Ist</forename>
                <surname>Inria Sophia Antipolis-Méditerranée / I3s</surname>
              </persName>
              <email type="md5">7c88c2dda46d455591481b4e07aef779</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-04-03 16:07:50</date>
              <date type="whenModified">2024-04-09 08:56:04</date>
              <date type="whenReleased">2014-04-16 09:48:41</date>
              <date type="whenProduced">2008-01-01</date>
              <date type="whenEndEmbargoed">2014-04-03</date>
              <ref type="file" target="https://inria.hal.science/hal-00972310v1/document">
                <date notBefore="2014-04-03"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00972310v1/file/541-2702-1-PB.pdf" id="file-972310-661745">
                <date notBefore="2014-04-03"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="129574">
                <persName>
                  <forename>Service Ist</forename>
                  <surname>Inria Sophia Antipolis-Méditerranée / I3s</surname>
                </persName>
                <email type="md5">7c88c2dda46d455591481b4e07aef779</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00972310</idno>
            <idno type="halUri">https://inria.hal.science/hal-00972310</idno>
            <idno type="halBibtex">wood:hal-00972310</idno>
            <idno type="halRefHtml">&lt;i&gt;Discrete Mathematics and Theoretical Computer Science&lt;/i&gt;, 2008, Vol. 10 no. 1 (1), pp.27--34. &lt;a target="_blank" href="https://dx.doi.org/10.46298/dmtcs.434"&gt;&amp;#x27E8;10.46298/dmtcs.434&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.27--34. &amp;#x27E8;10.46298/dmtcs.434&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-972310-661745"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="DMTCS">DMTCS</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Graphs and Algorithms</note>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Bounded-degree graphs have arbitrarily large queue-number</title>
                <author role="aut">
                  <persName>
                    <forename type="first">David R.</forename>
                    <surname>Wood</surname>
                  </persName>
                  <idno type="halauthorid">606878-0</idno>
                  <affiliation ref="#struct-18818"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">649</idno>
                <idno type="issn">1462-7264</idno>
                <idno type="eissn">1365-8050</idno>
                <title level="j">Discrete Mathematics and Theoretical Computer Science</title>
                <imprint>
                  <publisher>DMTCS</publisher>
                  <biblScope unit="volume">Vol. 10 no. 1</biblScope>
                  <biblScope unit="issue">1</biblScope>
                  <biblScope unit="pp">27--34</biblScope>
                  <date type="datePub">2008-01-01</date>
                </imprint>
              </monogr>
              <idno type="doi">10.46298/dmtcs.434</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all \Delta ≥ 3 and for all sufﬁciently large n, there is a simple \Delta-regular n-vertex graph with queue-number at least c√\Delta_n^{1/2-1/\Delta} for some absolute constant c.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-18818" status="VALID">
          <orgName>Departament de Matemàtica Aplicada II</orgName>
          <desc>
            <address>
              <addrLine>Universitat Politècnica de Catalunya (UPC) Edifici Omega, Campus Nord Jordi Girona, 1-3 E-08034 Barcelona Spain</addrLine>
              <country key="ES"/>
            </address>
            <ref type="url">http://www.ma2.upc.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-85878" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-85878" status="VALID">
          <idno type="ROR">https://ror.org/03mb6wj31</idno>
          <orgName>Universitat Politècnica de Catalunya =  Université polytechnique de Catalogne = Polytechnic University of Catalunya [Barcelona]</orgName>
          <orgName type="acronym">UPC</orgName>
          <desc>
            <address>
              <addrLine>C./Jordi Girona, 1-3, 08034 Barcelona</addrLine>
              <country key="ES"/>
            </address>
            <ref type="url">https://www.upc.edu/ca</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>