Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs | Paper Citation Record

Observation 1b8b3a62-4c22-449b-9352-445d98972ba9 · outbound

This paper cites Four degrees of separation.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Four degrees of separation

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:34.950096Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63eb856c-c94f-443a-b037-68ed27db9378 · outbound

This paper cites Hyperbolic random graphs: Clique number and degeneracy with implications for colouring.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Hyperbolic random graphs: Clique number and degeneracy with implications for colouring

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:35.172006Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8bb53816-dc88-4585-a781-2fcef3d28d1e · outbound

This paper cites Improved distributed fractional coloring algorithms.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Improved distributed fractional coloring algorithms

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:35.234037Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4977d60-5518-40ff-984d-883ef5a9c2ac · outbound

This paper cites Distributed coloring of graphs with an optimal number of colors.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Distributed coloring of graphs with an optimal number of colors

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:35.330050Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c80c835-0a79-49ac-922d-c466a72ba089 · outbound

This paper cites Deterministic distributed vertex coloring in polylogarith- mic time.Journal of the ACM, 58(5):23:1–23:25, 2011.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Deterministic distributed vertex coloring in polylogarith- mic time.Journal of the ACM, 58(5):23:1–23:25, 2011

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:35.419266Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0975d0de-a6dd-457e-b544-15ad0745c134 · outbound

This paper cites A fast network-decomposition algorithm and its applications to constant-time distributed computation.Theoretical Computer Science, 751:2–23, 2018.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs A fast network-decomposition algorithm and its applications to constant-time distributed computation.Theoretical Computer Science, 751:2–23, 2018

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:35.505955Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67f644ef-4272-4d03-812d-aa0bb02cd5f1 · outbound

This paper cites The diameter of (threshold) geometric inhomogeneous random graphs.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs The diameter of (threshold) geometric inhomogeneous random graphs

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:35.624350Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fbdc0ae4-f5fd-44c7-b79a-6d9327904377 · outbound

This paper cites On the external validity of average-case analyses of graph algorithms.ACM Transactions on Algorithms, 20(1):1–42, 2024.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs On the external validity of average-case analyses of graph algorithms.ACM Transactions on Algorithms, 20(1):1–42, 2024

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:35.725094Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0f5ec040-928f-4af1-8154-0f64a1e95fc8 · outbound

This paper cites On the giant component of geometric inhomogeneous random graphs.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs On the giant component of geometric inhomogeneous random graphs

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:35.829448Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4cafb5e5-bf55-4011-822f-2a79a8d6b621 · outbound

This paper cites Strongly hyperbolic unit disk graphs.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Strongly hyperbolic unit disk graphs

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:35.956249Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c8a27f9-d910-4152-a2a7-4186eb7d974b · outbound

This paper cites Hyperbolic random graphs: Separators and treewidth.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Hyperbolic random graphs: Separators and treewidth

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.066920Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89cb7587-912e-4969-9f1f-f93d8df1f658 · outbound

This paper cites an unresolved cited work.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.162703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ff10806-067d-42ef-9771-3251818888fc · outbound

This paper cites Ángeles Serrano.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Ángeles Serrano

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.277198Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f926e0f-39b5-4cdb-bcf2-cb5bdde9fd3c · outbound

This paper cites Sustaining the internet with hyperbolic mapping.Nature Communications, 1:62, 2010.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Sustaining the internet with hyperbolic mapping.Nature Communications, 1:62, 2010

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.359574Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b590548-5a03-4a5a-91bf-e3a9b9d2b427 · outbound

This paper cites Faster distributed∆-coloring via a reduction to MIS.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Faster distributed∆-coloring via a reduction to MIS

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.449189Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57735818-c780-4691-b1cc-aeeccd83b556 · outbound

This paper cites Distributed recoloring of interval and chordal graphs.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Distributed recoloring of interval and chordal graphs

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.600755Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0aa5bfe3-e9e5-41f8-a31a-017d7b63bdde · outbound

This paper cites Sampling geometric inhomogeneous random graphs in linear time.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Sampling geometric inhomogeneous random graphs in linear time

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.665955Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bad9aa7f-e7d9-461a-a62b-d529249d655b · outbound

This paper cites Geometric inhomogeneous random graphs.Theoretical Computer Science, 760:35–54, 2019.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Geometric inhomogeneous random graphs.Theoretical Computer Science, 760:35–54, 2019

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.746838Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 202846bc-94b1-4b5e-8d59-94654e26fa4a · outbound

This paper cites Average distance in a general class of scale-free networks.Advances in Applied Probability, 57(2):371–406, 2025.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Average distance in a general class of scale-free networks.Advances in Applied Probability, 57(2):371–406, 2025

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.816597Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ee1ab6c-a306-4169-b976-a58576a54eae · outbound

This paper cites Greedy routing and the algorithmic small-world phenomenon.Journal of Computer and System Sciences, 125:59–105, 2022.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Greedy routing and the algorithmic small-world phenomenon.Journal of Computer and System Sciences, 125:59–105, 2022

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:36.910061Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a537ab9-1630-4c33-a7d4-58d1ead65b2a · outbound

This paper cites Graph structure in the web.Computer Networks, 33(1–6):309–320, 2000.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Graph structure in the web.Computer Networks, 33(1–6):309–320, 2000

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.015359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b682fc8c-8bca-46b3-8262-e253e50a934d · outbound

This paper cites Balanced Bidirectional Breadth-First Search on Scale-Free Networks.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Balanced Bidirectional Breadth-First Search on Scale-Free Networks

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.107175Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e093755-13d9-4905-abd3-c403e329897b · outbound

This paper cites an unresolved cited work.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.214668Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6698e67a-2882-4954-a83b-5f1b634e2eb5 · outbound

This paper cites No distributed quantum advantage for approximate graph coloring.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs No distributed quantum advantage for approximate graph coloring

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.271956Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 75c6c055-237c-4316-8f54-79fc77510e23 · outbound

This paper cites Location- oblivious distributed unit disk graph coloring.Algorithmica, 60:236–249, 2011.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Location- oblivious distributed unit disk graph coloring.Algorithmica, 60:236–249, 2011

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.365438Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c58f969-f078-4978-941a-6f28bca78fb4 · outbound

This paper cites Probabilistic tools for the analysis of randomized optimization heuristics.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Probabilistic tools for the analysis of randomized optimization heuristics

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.457529Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 448cfe04-52db-479a-a3c2-075f287f0ee8 · outbound

This paper cites Three and a half degrees of separation.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Three and a half degrees of separation

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.547800Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d3ba8604-b7d1-4323-a6f2-f7354be0db22 · outbound

This paper cites Distributed coloring and the local structure of unit-disk graphs.Theoretical Computer Science, 944:113674, 2023.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Distributed coloring and the local structure of unit-disk graphs.Theoretical Computer Science, 944:113674, 2023

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.558597Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1af14286-aebc-4b3e-b307-097474b63c21 · outbound

This paper cites On power-law relationships of the internet topology.ACM SIGCOMM Computer Communication Review, 29(4):251–262, 1999.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs On power-law relationships of the internet topology.ACM SIGCOMM Computer Communication Review, 29(4):251–262, 1999

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.614912Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2eea7291-29f9-4a13-bc29-baf7c65e0cc8 · outbound

This paper cites Halldórsson, Fabian Kuhn, and Alexandre Nolin.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Halldórsson, Fabian Kuhn, and Alexandre Nolin

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.709014Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b94ab36d-7dc5-46bc-a2c2-1a1154cf5d07 · outbound

This paper cites Halldórsson, Manuel Jakob, and Yannic Maus.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Halldórsson, Manuel Jakob, and Yannic Maus

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.780830Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ef17f0c-1a97-465e-bb63-74dc7f4a44e2 · outbound

This paper cites Near-optimal deterministic network decomposition and ruling set, and improved MIS.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Near-optimal deterministic network decomposition and ruling set, and improved MIS

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.847008Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d40d041-7a06-4034-af75-c9c0630f33d3 · outbound

This paper cites Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.920434Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d040aef2-d993-43a9-8d05-c2ab0fb97a7f · outbound

This paper cites From descriptive to distributed.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs From descriptive to distributed

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:37.972964Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 584c93ca-1cdf-4910-b17d-d590d1bbcbd0 · outbound

This paper cites Random hyperbolic graphs: Degree sequence and clustering.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Random hyperbolic graphs: Degree sequence and clustering

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.044402Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de891417-65cc-4652-a626-fea09e44ef30 · outbound

This paper cites Halldórsson and Christian Konrad.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Halldórsson and Christian Konrad

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.201872Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9acec360-5d5b-4fc0-a4ce-9d7e92f096c9 · outbound

This paper cites Halldórsson and Yannic Maus.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Halldórsson and Yannic Maus

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.272367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 43e1f373-1ec2-4f74-8a1b-29b636795292 · outbound

This paper cites Oltvai, and Albert-László Barabási.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Oltvai, and Albert-László Barabási

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.350967Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 677907d1-640a-4930-b3b2-d0ef9a0e79d7 · outbound

This paper cites Simple distributed∆ + 1-coloring of graphs.Information Processing Letters, 70(5):229–232, 1999.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Simple distributed∆ + 1-coloring of graphs.Information Processing Letters, 70(5):229–232, 1999

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.463496Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be8a4a2c-4219-44ef-9ca6-ad012a71fbcc · outbound

This paper cites an unresolved cited work.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Unresolved cited work

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.520119Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4d61253-93e5-4940-a7ac-5e722193810f · outbound

This paper cites an unresolved cited work.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Unresolved cited work

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.633881Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 10ba8b71-800a-407d-8984-0d8eccc3ebd0 · outbound

This paper cites On the second largest component of random hyperbolic graphs.SIAM Journal on Discrete Mathematics, 33(4):2200–2217, 2019.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs On the second largest component of random hyperbolic graphs.SIAM Journal on Discrete Mathematics, 33(4):2200–2217, 2019

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.723187Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7f24084-c360-4a53-b53c-f6fab5077e9e · outbound

This paper cites Distributed minimum vertex coloring and maximum independent set in chordal graphs.Theoretical Computer Science, 922:486–502, 2022.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Distributed minimum vertex coloring and maximum independent set in chordal graphs.Theoretical Computer Science, 922:486–502, 2022

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.799382Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 054c671d-bdd7-42e7-9e13-de8a775c2160 · outbound

This paper cites Hyperbolic geometry of complex networks.Physical Review E, 82(3):036106, 2010.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Hyperbolic geometry of complex networks.Physical Review E, 82(3):036106, 2010

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.860921Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ab95794-c70d-4ca5-90c9-a6679467697e · outbound

This paper cites Low-diameter graph decompositions.Combinatorica, 13(4):441– 454, 1993.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Low-diameter graph decompositions.Combinatorica, 13(4):441– 454, 1993

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:38.946157Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5e63e3c-c79f-4066-8eb1-83d16a47c353 · outbound

This paper cites On distributed colouring of hyperbolic random graphs.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs On distributed colouring of hyperbolic random graphs

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:39.019575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d6b9e0e-b31c-4775-8b91-3b941d347c94 · outbound

This paper cites Concentration for self-bounding functions and an inequality of talagrand.Random Structures & Algorithms, 29(4):549–557, 2006.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Concentration for self-bounding functions and an inequality of talagrand.Random Structures & Algorithms, 29(4):549–557, 2006

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:39.080882Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e652eb80-3256-4202-a399-88c34d604f47 · outbound

This paper cites Cambridge University Press, 2005.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Cambridge University Press, 2005

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:39.177846Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f12d4afb-d736-403c-b6d1-1f6bda58b7c0 · outbound

This paper cites Colouring graphs when the number of colours is almost the maximum degree.Journal of Combinatorial Theory, Series B, 109:134–195, 2014.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Colouring graphs when the number of colours is almost the maximum degree.Journal of Combinatorial Theory, Series B, 109:134–195, 2014

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:39.262369Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6b05a0b-3244-4962-81e3-d8ddc02ac2fb · outbound

This paper cites The diameter of KPKVB random graphs.Advances in Applied Probability, 51(2):358–377, 2019.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs The diameter of KPKVB random graphs.Advances in Applied Probability, 51(2):358–377, 2019

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:39.311994Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2e6ee68-ffcc-4136-9cb3-3522a122e869 · outbound

This paper cites Ángeles Serrano, Marián Boguná, and Dmitri Krioukov.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Ángeles Serrano, Marián Boguná, and Dmitri Krioukov

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:39.391769Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89efef97-4316-4dc7-b2a7-bceef8fe7f90 · outbound

This paper cites Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:39.451877Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e273a13-b695-484f-b21b-4c0c0991789c · outbound

This paper cites Network mapping by replaying hyperbolic growth.IEEE/ACM Transactions on Networking, 23(1):198–211, 2015.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Network mapping by replaying hyperbolic growth.IEEE/ACM Transactions on Networking, 23(1):198–211, 2015

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:39.526129Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b87d919-06dd-4f46-883a-ac89e1ec9176 · outbound

This paper cites Ángeles Serrano, Dmitri Krioukov, and Marián Boguná.

Distributed Colouring with 4/3 chi Colours for Hyperbolic Random Graphs Ángeles Serrano, Dmitri Krioukov, and Marián Boguná

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-01T10:10:39.582338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers