Authors: Ito, Takehiro, Iwamasa, Yuni, Kobayashi, Yusuke, Maezawa, Shun-ichi, Nozaki, Yuta, Okamoto, Yoshio, Ozeki, Kenta
Subject Terms: Graph coloring, Triangulation of the sphere, Combinatorial reconfiguration, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Graph coloring
File Description: application/pdf
Relation: https://dx.doi.org/10.48550/arXiv.2210.17105; https://dx.doi.org/10.4230/LIPIcs.SoCG.2023; https://dx.doi.org/10.1016/j.jctb.2018.08.002; https://dx.doi.org/10.48550/arXiv.2112.02313; https://dx.doi.org/10.1016/j.tcs.2009.08.023; https://dx.doi.org/10.1016/j.disc.2007.07.028; https://dx.doi.org/10.1016/j.ejc.2009.03.011; https://dx.doi.org/10.1002/jgt.20514; https://dx.doi.org/10.1137/1.9781611975482.134; https://dx.doi.org/10.1016/j.apal.2005.12.011; https://dx.doi.org/10.1137/0214017; https://dx.doi.org/10.1002/jgt.21847; https://dx.doi.org/10.4153/CJM-1980-057-7; https://dx.doi.org/10.48550/arXiv.2101.04065; https://dx.doi.org/10.1016/j.ejc.2016.06.008; https://dx.doi.org/10.1016/0001-8708(73)90015-7; https://dx.doi.org/10.1016/0001-8708(73)90016-9; https://dx.doi.org/10.1016/0001-8708(77)90061-5
Availability: https://doi.org/10.4230/lipics.socg.2023.4310.48550/arXiv.2210.1710510.4230/LIPIcs.SoCG.202310.1016/j.jctb.2018.08.00210.48550/arXiv.2112.0231310.1016/j.tcs.2009.08.02310.1016/j.disc.2007.07.02810.1016/j.ejc.2009.03.01110.1002/jgt.2051410.1137/1.9781611975482.13410.1016/j.apal.2005.12.01110.1137/021401710.1002/jgt.2184710.4153/CJM-1980-057-710.48550/arXiv.2101.0406510.1016/j.ejc.2016.06.00810.1016/0001-8708(73)90015-710.1016/0001-8708(73)90016-910.1016/0001-8708(77)90061-5
Authors: Kirchweger, Markus, Peitl, Tomáš, Szeider, Stefan
Subject Terms: hypergraphs, graph coloring, SAT modulo symmetries, Theory of computation → Automated reasoning, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph coloring, Mathematics of computing → Graph enumeration, Mathematics of computing → Matchings and factors
File Description: application/pdf
Relation: https://github.com/markirch/sat-modulo-symmetries/; https://sat-modulo-symmetries.readthedocs.io/; https://dx.doi.org/10.4230/LIPIcs.SAT.2023; https://dx.doi.org/10.1007/s10601-018-9294-5; https://dx.doi.org/10.4230/LIPIcs.SAT.2023.8; https://dx.doi.org/10.1145/3560469; https://dx.doi.org/10.1016/0304-3975(85)90144-6; https://dx.doi.org/10.4153/CJM-1981-046-9; https://dx.doi.org/10.48550/arXiv.2101.04698; https://dx.doi.org/10.4230/LIPIcs.SAT.2022.4; https://dx.doi.org/10.4230/LIPIcs.CP.2021.34; https://dx.doi.org/10.1016/j.jsc.2013.09.003; https://dx.doi.org/10.1142/S1793830914500396; https://dx.doi.org/10.1007/11564751_73; https://dx.doi.org/10.1007/978-3-319-09284-3_31
Availability: https://doi.org/10.4230/lipics.sat.2023.1310.4230/LIPIcs.SAT.202310.1007/s10601-018-9294-510.4230/LIPIcs.SAT.2023.810.1145/356046910.1016/0304-3975(85)90144-610.4153/CJM-1981-046-910.48550/arXiv.2101.0469810.4230/LIPIcs.SAT.2022.410.4230/LIPIcs.CP.2021.3410.1016/j.jsc.2013.09.00310.1142/S179383091450039610.1007/11564751_7310.1007/978-3-319-09284-3_31
Authors: Bonamy, Marthe
Subject Terms: Graph theory, graph coloring, reconfiguration, Mathematics of computing → Graph coloring
File Description: application/pdf
Authors: Fuchs, Marc, Kuhn, Fabian
Subject Terms: distributed coloring, list coloring, defective coloring, Theory of computation → Distributed algorithms, Mathematics of computing → Graph coloring
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.DISC.2023; https://dx.doi.org/10.1109/SFCS.1989.63504; https://dx.doi.org/10.1145/2979675; https://dx.doi.org/10.1007/s00446-009-0088-2; https://dx.doi.org/10.1145/2027216.2027221; https://dx.doi.org/10.1137/12088848X; https://dx.doi.org/10.1145/2903137; https://dx.doi.org/10.1145/3188745.3188964; https://dx.doi.org/10.48550/arXiv.2304.09666; https://dx.doi.org/10.1137/1.9781611976465.173; https://dx.doi.org/10.1109/SFCS.1987.20; https://dx.doi.org/10.1137/0215074; https://dx.doi.org/10.1137/0404036; https://dx.doi.org/10.1137/1.9780898719772; https://dx.doi.org/10.1145/1835698.1835760
Authors: Flin, Maxime, Halldórsson, Magnús M., Nolin, Alexandre
Subject Terms: CONGEST model, distributed graph coloring, power graphs, Theory of computation → Distributed algorithms, Mathematics of computing → Graph coloring
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.DISC.2023; https://dx.doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.6; https://dx.doi.org/10.1016/0196-6774(86)90019-2; https://dx.doi.org/10.1137/1.9781611975482.48; https://dx.doi.org/10.2200/S00520ED1V01Y201307DCT011; https://dx.doi.org/10.1145/3486625; https://dx.doi.org/10.1145/2903137; https://dx.doi.org/10.48550/arXiv.2305.04358; https://dx.doi.org/10.1137/1.9781611975031.168; https://dx.doi.org/10.1137/19M1249527; https://dx.doi.org/10.1007/s00446-016-0287-6; https://dx.doi.org/10.1145/3293611.3331635; https://dx.doi.org/10.1137/1.9781611973730.26; https://dx.doi.org/10.1137/1.9781611977554.ch168; https://dx.doi.org/10.1137/1.9781611977554.ch98; https://dx.doi.org/10.1145/3558481.3591095; https://dx.doi.org/10.48550/arxiv.2301.06457
Availability: https://doi.org/10.4230/lipics.disc.2023.1910.4230/LIPIcs.DISC.202310.4230/LIPIcs.APPROX/RANDOM.2020.610.1016/0196-6774(86)90019-210.1137/1.9781611975482.4810.2200/S00520ED1V01Y201307DCT01110.1145/348662510.1145/290313710.48550/arXiv.2305.0435810.1137/1.9781611975031.16810.1137/19M124952710.1007/s00446-016-0287-610.1145/3293611.333163510.1137/1.9781611973730.2610.1137/1.9781611977554.ch16810.1137/1.9781611977554.ch9810.1145/3558481.359109510.48550/arxiv.2301.06457
Authors: Chawin, Dror, Haviv, Ishay
Subject Terms: hardness of approximation, graph coloring, orthogonality dimension, minrank, index coding, Mathematics of computing → Graph coloring, Mathematics of computing → Coding theory, Theory of computation → Problems, reductions and completeness
File Description: application/pdf
Authors: Škoviera, Martin, Varša, Peter
Subject Terms: cubic graph, edge colouring, snark, perfect matching, covering, NP-completeness, Mathematics of computing → Matchings and factors, Theory of computation → Problems, reductions and completeness, Mathematics of computing → Graph coloring
File Description: application/pdf
Authors: Pach, János, Tardos, Gábor, Tóth, Géza
Subject Terms: chi-bounded, disjointness graph, Mathematics of computing → Graph coloring
File Description: application/pdf
Subject Terms: geometric intersection graphs, weak and strong coloring numbers, Mathematics of computing → Combinatoric problems, Mathematics of computing → Graph coloring
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.SoCG.2022; https://dx.doi.org/10.1137/20M1311156; https://dx.doi.org/10.4230/LIPIcs.ICALP.2017.63
Authors: Haviv, Ishay, Parnas, Michal
Subject Terms: Binary rank, Boolean rank, Regular matrices, Non-deterministic communication complexity, Biclique partition number, Chromatic number, Theory of computation → Communication complexity, Mathematics of computing → Graph coloring
File Description: application/pdf
Subject Terms: locally checkable problem, clique-width, dynamic programming, coloring, Mathematics of computing → Graph algorithms, Mathematics of computing → Graph coloring, Mathematics of computing → Combinatorial optimization, Mathematics of computing → Combinatorial algorithms, Theory of computation → Problems, reductions and completeness
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.ISAAC.2022; https://dx.doi.org/10.1016/j.amc.2020.125444; https://dx.doi.org/10.1007/s00453-017-0283-7; https://dx.doi.org/10.1016/j.dam.2019.07.010; https://dx.doi.org/10.1016/j.dam.2016.03.017; https://dx.doi.org/10.48550/arXiv.2202.13335; https://dx.doi.org/10.1016/j.dam.2022.01.019; https://dx.doi.org/10.1016/j.tcs.2013.01.009; https://dx.doi.org/10.7151/dmgt.1195; https://dx.doi.org/10.1016/j.disc.2003.06.004; https://dx.doi.org/10.1007/s002249910009; https://dx.doi.org/10.1016/0022-0000(93)90004-G; https://dx.doi.org/10.1016/S0166-218X(99)00184-5; https://dx.doi.org/10.1145/2843043.2843053; https://dx.doi.org/10.1016/j.apal.2004.01.007; https://dx.doi.org/10.1007/s00607-008-0005-8; https://dx.doi.org/10.48550/arXiv.2203.15724
Availability: https://doi.org/10.4230/lipics.isaac.2022.3110.4230/LIPIcs.ISAAC.202210.1016/j.amc.2020.12544410.1007/s00453-017-0283-710.1016/j.dam.2019.07.01010.1016/j.dam.2016.03.01710.48550/arXiv.2202.1333510.1016/j.dam.2022.01.01910.1016/j.tcs.2013.01.00910.7151/dmgt.119510.1016/j.disc.2003.06.00410.1007/s00224991000910.1016/0022-0000(93)90004-G10.1016/S0166-218X(99)00184-510.1145/2843043.284305310.1016/j.apal.2004.01.00710.1007/s00607-008-0005-810.48550/arXiv.2203.15724
Subject Terms: graph homomorphism, forbidden induced subgraphs, precoloring extension, Mathematics of computing → Graph coloring, Theory of computation → Graph algorithms analysis
File Description: application/pdf
Relation: http://journals.cambridge.org/action/displayAbstract?aid=46667; https://dx.doi.org/10.4230/LIPIcs.ISAAC.2022; https://dx.doi.org/10.1137/1.9781611977073.61; https://dx.doi.org/10.1016/S0166-218X(02)00290-1; https://dx.doi.org/10.1007/978-3-030-39219-2_16; https://dx.doi.org/10.1007/s00493-017-3553-8; https://dx.doi.org/10.1016/j.tcs.2005.09.028; https://dx.doi.org/10.1109/FOCS.2017.37; https://dx.doi.org/10.1016/0095-8956(88)90069-X; https://dx.doi.org/10.1016/j.jctb.2019.04.006; https://dx.doi.org/10.4230/LIPIcs.ESA.2019.31; https://dx.doi.org/10.1137/20M1367660; https://dx.doi.org/10.1016/j.jctb.2008.03.002; https://dx.doi.org/10.1016/0890-5401(90)90043-H; https://dx.doi.org/10.48550/arXiv.2205.13270; https://dx.doi.org/10.4153/CJM-1965-045-4
Availability: https://doi.org/10.4230/lipics.isaac.2022.1410.4230/LIPIcs.ISAAC.202210.1137/1.9781611977073.6110.1016/S0166-218X(02)00290-110.1007/978-3-030-39219-2_1610.1007/s00493-017-3553-810.1016/j.tcs.2005.09.02810.1109/FOCS.2017.3710.1016/0095-8956(88)90069-X10.1016/j.jctb.2019.04.00610.4230/LIPIcs.ESA.2019.3110.1137/20M136766010.1016/j.jctb.2008.03.00210.1016/0890-5401(90)90043-H10.48550/arXiv.2205.1327010.4153/CJM-1965-045-4
Authors: Haviv, Ishay
Subject Terms: Kneser graph, Fixed-parameter tractability, Agreeable Set, Theory of computation → Fixed parameter tractability, Mathematics of computing → Graph coloring, Mathematics of computing → Combinatorial algorithms, Mathematics of computing → Probabilistic algorithms
File Description: application/pdf
Subject Terms: Edge coloring, streaming model, adversarial order, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Graph coloring
File Description: application/pdf
Subject Terms: graph coloring, LOCAL model, shared-memory model, immediate snapshot, renaming, wait-free algorithms, Theory of computation → Distributed algorithms, Mathematics of computing → Graph coloring, Computer systems organization → Dependable and fault-tolerant systems and networks, Theory of computation → Models of computation
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.DISC.2022; https://dx.doi.org/10.1145/301308.301335; https://dx.doi.org/10.1007/978-3-642-31104-8_17; https://dx.doi.org/10.1145/79147.79158; https://dx.doi.org/10.1137/16M1081439; https://dx.doi.org/10.1007/3-540-40026-5_10; https://dx.doi.org/10.1016/j.jpdc.2015.09.002; https://dx.doi.org/10.1002/0471478210; https://dx.doi.org/10.2200/S00520ED1V01Y201307DCT011; https://dx.doi.org/10.1145/3212734.3212769; https://dx.doi.org/10.1109/IPDPS.2009.5161053; https://dx.doi.org/10.1016/j.tcs.2012.01.034; https://dx.doi.org/10.4230/LIPIcs.DISC.2019.37; https://dx.doi.org/10.1007/s00224-017-9772-y; https://dx.doi.org/10.1007/s00446-010-0108-2; https://dx.doi.org/10.1145/2108242.2108245; https://dx.doi.org/10.1007/978-3-642-35476-2_7
Subject Terms: Graph coloring, maximum clique, Boolean satisfiability, Theory of computation → Constraint and logic programming, Mathematics of computing → Graph coloring
File Description: application/pdf
Relation: https://github.com/marijnheule/clicolcom; http://www.nlsde.buaa.edu.en/~kexu/benchmarks/graphbenchmarks.htm; https://dx.doi.org/10.4230/LIPIcs.CP.2022; https://dx.doi.org/10.1145/3437359.3465593
Authors: Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva, Herman, Grzegorz
Subject Terms: LIPIcs, Volume 244, ESA 2022, Complete Volume, Applied computing → Transportation, Computing methodologies → Linear algebra algorithms, Computing methodologies → Shared memory algorithms, Human-centered computing → Graph drawings, Information systems → Clustering, Information systems → Data structures, Mathematics of computing → Algebraic topology, Mathematics of computing → Approximation algorithms, Mathematics of computing → Combinatorial algorithms, Mathematics of computing → Combinatorial optimization, Mathematics of computing → Combinatorics, Mathematics of computing → Discrete optimization, Mathematics of computing → Graph algorithms, Mathematics of computing → Graph coloring, Mathematics of computing → Graph theory, Mathematics of computing → Network flows, Mathematics of computing → Paths and connectivity problems, Mathematics of computing → Permutations and combinations, Mathematics of computing → Probabilistic algorithms, Mathematics of computing → Random graphs, Mathematics of computing → Trees, Networks → Network algorithms, Theory of computation → Algorithm design techniques, Theory of computation → Approximation algorithms analysis, Theory of computation → Bloom filters and hashing, Theory of computation → Branch-and-bound, Theory of computation → Communication complexity, Theory of computation → Complexity theory and logic, Theory of computation → Computational geometry
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.ESA.2022.0; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.1; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.2; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.3; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.4; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.5; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.6; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.7; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.8; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.9; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.10; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.11; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.12; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.13; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.14; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.15; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.16; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.17; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.18; https://dx.doi.org/10.4230/LIPIcs.ESA.2022.19
Authors: Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva, Herman, Grzegorz
Subject Terms: Front Matter, Table of Contents, Preface, Conference Organization, Applied computing → Transportation, Computing methodologies → Linear algebra algorithms, Computing methodologies → Shared memory algorithms, Human-centered computing → Graph drawings, Information systems → Clustering, Information systems → Data structures, Mathematics of computing → Algebraic topology, Mathematics of computing → Approximation algorithms, Mathematics of computing → Combinatorial algorithms, Mathematics of computing → Combinatorial optimization, Mathematics of computing → Combinatorics, Mathematics of computing → Discrete optimization, Mathematics of computing → Graph algorithms, Mathematics of computing → Graph coloring, Mathematics of computing → Graph theory, Mathematics of computing → Network flows, Mathematics of computing → Paths and connectivity problems, Mathematics of computing → Permutations and combinations, Mathematics of computing → Probabilistic algorithms, Mathematics of computing → Random graphs, Mathematics of computing → Trees, Networks → Network algorithms, Theory of computation → Algorithm design techniques, Theory of computation → Approximation algorithms analysis, Theory of computation → Bloom filters and hashing, Theory of computation → Branch-and-bound
File Description: application/pdf
Authors: Okrasa, Karolina, Rzążewski, Paweł
Subject Terms: list homomorphism, fine-grained complexity, hereditary graph classes, Mathematics of computing → Graph coloring, Theory of computation → Problems, reductions and completeness, Theory of computation → Graph algorithms analysis
File Description: application/pdf
Relation: http://journals.cambridge.org/action/displayAbstract?aid=46667; http://epubs.siam.org/sam-bin/dbq/article/38405; https://dx.doi.org/10.4230/LIPIcs.STACS.2021; https://dx.doi.org/10.1007/s00493-017-3553-8; https://dx.doi.org/10.1016/j.tcs.2005.09.028; https://dx.doi.org/10.4230/LIPIcs.ESA.2019.31; https://dx.doi.org/10.4230/LIPIcs.ESA.2020.35; https://dx.doi.org/10.1137/1.9781611975994.139; https://dx.doi.org/10.1007/s00493-010-2334-4; https://dx.doi.org/10.1109/LICS.2015.52; https://dx.doi.org/10.1137/1.9781611973402.26; https://dx.doi.org/10.4230/LIPIcs.STACS.2018.27; https://dx.doi.org/10.1006/jctb.1997.1812; https://dx.doi.org/10.1007/s004939970003; https://dx.doi.org/10.1002/jgt.10073; https://dx.doi.org/10.1016/j.disc.2005.09.030; https://dx.doi.org/10.1016/j.dam.2011.04.005
Authors: Jaffke, Lars, Lima, Paloma T., Lokshtanov, Daniel
Subject Terms: b-Coloring, clique-width, vertex cover, structural parameterization, Mathematics of computing → Graph coloring
File Description: application/pdf