Brooks-type colourings of digraphs in linear time

Brooks' Theorem is a fundamental result on graph colouring, stating that the chromatic number of a graph is almost always upper bounded by its maximal degree. Lovász showed that such a colouring may then be computed in linear time when it exists. Many analogues are known for variants of (di)gra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2024-05
Hauptverfasser: Gonçalves, Daniel, Lucas Picasarri-Arrieta, Amadeus Reinald
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Gonçalves, Daniel
Lucas Picasarri-Arrieta
Amadeus Reinald
description Brooks' Theorem is a fundamental result on graph colouring, stating that the chromatic number of a graph is almost always upper bounded by its maximal degree. Lovász showed that such a colouring may then be computed in linear time when it exists. Many analogues are known for variants of (di)graph colouring, notably for list-colouring and partitions into subgraphs with prescribed degeneracy. One of the most general results of this kind is due to Borodin, Kostochka, and Toft, when asking for classes of colours to satisfy "variable degeneracy" constraints. An extension of this result to digraphs has recently been proposed by Bang-Jensen, Schweser, and Stiebitz, by considering colourings as partitions into "variable weakly degenerate" subdigraphs. Unlike earlier variants, there exists no linear-time algorithm to produce colourings for these generalisations. We introduce the notion of (variable) bidegeneracy for digraphs, capturing multiple (di)graph degeneracy variants. We define the corresponding concept of \(F\)-dicolouring, where \(F = (f_1,...,f_s)\) is a vector of functions, and an \(F\)-dicolouring requires vertices coloured \(i\) to induce a "strictly-\(f_i\)-bidegenerate" subdigraph. We prove an analogue of Brooks' theorem for \(F\)-dicolouring, generalising the result of Bang-Jensen et al., and earlier analogues in turn. Our new approach provides a linear-time algorithm that, given a digraph \(D\), either produces an \(F\)-dicolouring of \(D\), or correctly certifies that none exist. This yields the first linear-time algorithms to compute (di)colourings corresponding to the aforementioned generalisations of Brooks' theorem. In turn, it gives an unified framework to compute such colourings for various intermediate generalisations of Brooks' theorem such as list-(di)colouring and partitioning into (variable) degenerate sub(di)graphs.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_3052863610</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3052863610</sourcerecordid><originalsourceid>FETCH-proquest_journals_30528636103</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwdCrKz88u1i2pLEhVSM7PyS8tysxLL1bIT1NIyUwvSizIKFbIzFPIycxLTSxSKMnMTeVhYE1LzClO5YXS3AzKbq4hzh66BUX5haWpxSXxWUBD8oBS8cYGpkYWZsZmhgbGxKkCALXgM4Y</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3052863610</pqid></control><display><type>article</type><title>Brooks-type colourings of digraphs in linear time</title><source>Free E- Journals</source><creator>Gonçalves, Daniel ; Lucas Picasarri-Arrieta ; Amadeus Reinald</creator><creatorcontrib>Gonçalves, Daniel ; Lucas Picasarri-Arrieta ; Amadeus Reinald</creatorcontrib><description>Brooks' Theorem is a fundamental result on graph colouring, stating that the chromatic number of a graph is almost always upper bounded by its maximal degree. Lovász showed that such a colouring may then be computed in linear time when it exists. Many analogues are known for variants of (di)graph colouring, notably for list-colouring and partitions into subgraphs with prescribed degeneracy. One of the most general results of this kind is due to Borodin, Kostochka, and Toft, when asking for classes of colours to satisfy "variable degeneracy" constraints. An extension of this result to digraphs has recently been proposed by Bang-Jensen, Schweser, and Stiebitz, by considering colourings as partitions into "variable weakly degenerate" subdigraphs. Unlike earlier variants, there exists no linear-time algorithm to produce colourings for these generalisations. We introduce the notion of (variable) bidegeneracy for digraphs, capturing multiple (di)graph degeneracy variants. We define the corresponding concept of \(F\)-dicolouring, where \(F = (f_1,...,f_s)\) is a vector of functions, and an \(F\)-dicolouring requires vertices coloured \(i\) to induce a "strictly-\(f_i\)-bidegenerate" subdigraph. We prove an analogue of Brooks' theorem for \(F\)-dicolouring, generalising the result of Bang-Jensen et al., and earlier analogues in turn. Our new approach provides a linear-time algorithm that, given a digraph \(D\), either produces an \(F\)-dicolouring of \(D\), or correctly certifies that none exist. This yields the first linear-time algorithms to compute (di)colourings corresponding to the aforementioned generalisations of Brooks' theorem. In turn, it gives an unified framework to compute such colourings for various intermediate generalisations of Brooks' theorem such as list-(di)colouring and partitioning into (variable) degenerate sub(di)graphs.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Apexes ; Graph coloring ; Graph theory ; Theorems</subject><ispartof>arXiv.org, 2024-05</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Gonçalves, Daniel</creatorcontrib><creatorcontrib>Lucas Picasarri-Arrieta</creatorcontrib><creatorcontrib>Amadeus Reinald</creatorcontrib><title>Brooks-type colourings of digraphs in linear time</title><title>arXiv.org</title><description>Brooks' Theorem is a fundamental result on graph colouring, stating that the chromatic number of a graph is almost always upper bounded by its maximal degree. Lovász showed that such a colouring may then be computed in linear time when it exists. Many analogues are known for variants of (di)graph colouring, notably for list-colouring and partitions into subgraphs with prescribed degeneracy. One of the most general results of this kind is due to Borodin, Kostochka, and Toft, when asking for classes of colours to satisfy "variable degeneracy" constraints. An extension of this result to digraphs has recently been proposed by Bang-Jensen, Schweser, and Stiebitz, by considering colourings as partitions into "variable weakly degenerate" subdigraphs. Unlike earlier variants, there exists no linear-time algorithm to produce colourings for these generalisations. We introduce the notion of (variable) bidegeneracy for digraphs, capturing multiple (di)graph degeneracy variants. We define the corresponding concept of \(F\)-dicolouring, where \(F = (f_1,...,f_s)\) is a vector of functions, and an \(F\)-dicolouring requires vertices coloured \(i\) to induce a "strictly-\(f_i\)-bidegenerate" subdigraph. We prove an analogue of Brooks' theorem for \(F\)-dicolouring, generalising the result of Bang-Jensen et al., and earlier analogues in turn. Our new approach provides a linear-time algorithm that, given a digraph \(D\), either produces an \(F\)-dicolouring of \(D\), or correctly certifies that none exist. This yields the first linear-time algorithms to compute (di)colourings corresponding to the aforementioned generalisations of Brooks' theorem. In turn, it gives an unified framework to compute such colourings for various intermediate generalisations of Brooks' theorem such as list-(di)colouring and partitioning into (variable) degenerate sub(di)graphs.</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Graph coloring</subject><subject>Graph theory</subject><subject>Theorems</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwdCrKz88u1i2pLEhVSM7PyS8tysxLL1bIT1NIyUwvSizIKFbIzFPIycxLTSxSKMnMTeVhYE1LzClO5YXS3AzKbq4hzh66BUX5haWpxSXxWUBD8oBS8cYGpkYWZsZmhgbGxKkCALXgM4Y</recordid><startdate>20240508</startdate><enddate>20240508</enddate><creator>Gonçalves, Daniel</creator><creator>Lucas Picasarri-Arrieta</creator><creator>Amadeus Reinald</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20240508</creationdate><title>Brooks-type colourings of digraphs in linear time</title><author>Gonçalves, Daniel ; Lucas Picasarri-Arrieta ; Amadeus Reinald</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_30528636103</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Graph coloring</topic><topic>Graph theory</topic><topic>Theorems</topic><toplevel>online_resources</toplevel><creatorcontrib>Gonçalves, Daniel</creatorcontrib><creatorcontrib>Lucas Picasarri-Arrieta</creatorcontrib><creatorcontrib>Amadeus Reinald</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gonçalves, Daniel</au><au>Lucas Picasarri-Arrieta</au><au>Amadeus Reinald</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Brooks-type colourings of digraphs in linear time</atitle><jtitle>arXiv.org</jtitle><date>2024-05-08</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>Brooks' Theorem is a fundamental result on graph colouring, stating that the chromatic number of a graph is almost always upper bounded by its maximal degree. Lovász showed that such a colouring may then be computed in linear time when it exists. Many analogues are known for variants of (di)graph colouring, notably for list-colouring and partitions into subgraphs with prescribed degeneracy. One of the most general results of this kind is due to Borodin, Kostochka, and Toft, when asking for classes of colours to satisfy "variable degeneracy" constraints. An extension of this result to digraphs has recently been proposed by Bang-Jensen, Schweser, and Stiebitz, by considering colourings as partitions into "variable weakly degenerate" subdigraphs. Unlike earlier variants, there exists no linear-time algorithm to produce colourings for these generalisations. We introduce the notion of (variable) bidegeneracy for digraphs, capturing multiple (di)graph degeneracy variants. We define the corresponding concept of \(F\)-dicolouring, where \(F = (f_1,...,f_s)\) is a vector of functions, and an \(F\)-dicolouring requires vertices coloured \(i\) to induce a "strictly-\(f_i\)-bidegenerate" subdigraph. We prove an analogue of Brooks' theorem for \(F\)-dicolouring, generalising the result of Bang-Jensen et al., and earlier analogues in turn. Our new approach provides a linear-time algorithm that, given a digraph \(D\), either produces an \(F\)-dicolouring of \(D\), or correctly certifies that none exist. This yields the first linear-time algorithms to compute (di)colourings corresponding to the aforementioned generalisations of Brooks' theorem. In turn, it gives an unified framework to compute such colourings for various intermediate generalisations of Brooks' theorem such as list-(di)colouring and partitioning into (variable) degenerate sub(di)graphs.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2024-05
issn 2331-8422
language eng
recordid cdi_proquest_journals_3052863610
source Free E- Journals
subjects Algorithms
Apexes
Graph coloring
Graph theory
Theorems
title Brooks-type colourings of digraphs in linear time
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T18%3A34%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Brooks-type%20colourings%20of%20digraphs%20in%20linear%20time&rft.jtitle=arXiv.org&rft.au=Gon%C3%A7alves,%20Daniel&rft.date=2024-05-08&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E3052863610%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3052863610&rft_id=info:pmid/&rfr_iscdi=true