Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width | Paper Citation Record

Observation a03a4c41-3fa8-4387-85be-8c4347af7b74 · outbound

This paper cites On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters

Reference 1

Resolution: verified exact; local_arxiv, observed 2026-07-10T15:17:21.609799Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5c909780-edcb-49f8-be5f-4bf8652a79a4 · outbound

This paper cites Weisfeiler and Leman Go Relational , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Weisfeiler and Leman Go Relational , booktitle =

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.931889Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 585a4793-062a-4df9-a0f2-af8099b46222 · outbound

This paper cites 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025) , pages =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025) , pages =

Reference 3

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.658932Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 66d868e7-1f62-4e3d-9872-6766f3abf5e6 · outbound

This paper cites On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties , booktitle =

Reference 4

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.640527Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6fc720cb-46f9-4371-b18c-bb2edcf997f1 · outbound

This paper cites Counting Small Induced Subgraphs: Hardness via Fourier Analysis , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Counting Small Induced Subgraphs: Hardness via Fourier Analysis , booktitle =

Reference 5

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.645578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation df52214b-0c2e-4666-a335-c1e429dc088c · outbound

This paper cites 2026 , eprint=.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width 2026 , eprint=

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.947948Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 21b68ad6-9680-4d73-89c7-c3069207cab4 · outbound

This paper cites 6 Josep Díaz, Olli Pottonen, Maria J.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width 6 Josep Díaz, Olli Pottonen, Maria J

Reference 7

Resolution: metadata mismatch; doi, observed 2026-07-10T15:17:21.617574Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a3b48ddf-1dac-482f-a636-b2ae51f05ef5 · outbound

This paper cites Color Refinement, Homomorphisms, and Hypergraphs , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Color Refinement, Homomorphisms, and Hypergraphs , booktitle =

Reference 8

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.665047Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation fae161cb-8898-424c-8f9a-7ce7138287c5 · outbound

This paper cites In: 2021 36th Annual ACM/IEEE Sym- posium on Logic in Computer Science (LICS).

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width In: 2021 36th Annual ACM/IEEE Sym- posium on Logic in Computer Science (LICS)

Reference 9

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T15:17:21.615687Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation fa1e85bd-025d-4d9c-9051-21b40e30fca3 · outbound

This paper cites an unresolved cited work.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Unresolved cited work

Reference 10

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.611439Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 864bdca0-37c6-4fca-a520-90c3edfa2302 · outbound

This paper cites Lovász Meets Weisfeiler and Leman.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Lovász Meets Weisfeiler and Leman

Reference 11

Resolution: metadata mismatch; doi, observed 2026-07-10T15:17:21.666711Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 294e94c8-1f88-4d44-8d4c-446e32781b3d · outbound

This paper cites Journal of Graph Theory , volume=.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Journal of Graph Theory , volume=

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.944276Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4e43eb28-a12d-4929-9a02-9b85bb3182f1 · outbound

This paper cites nti, Series , volume=.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width nti, Series , volume=

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.946055Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8d7fa8b4-6378-4109-a03c-d85e4b5292bd · outbound

This paper cites Constraint Solving via Fractional Edge Covers , journal =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Constraint Solving via Fractional Edge Covers , journal =

Reference 14

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.623637Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c9d8acd9-1ecb-4d44-aa32-3e662c334cbf · outbound

This paper cites On lattices, learning with errors, random linear codes, and cryptography.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width On lattices, learning with errors, random linear codes, and cryptography

Reference 15

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T15:17:21.637062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 27650d93-ea32-483a-a711-9d4fb1b96fd1 · outbound

This paper cites Hypertree decompositions and tractable queries.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Hypertree decompositions and tractable queries

Reference 16

Resolution: verified exact; arxiv_id, observed 2026-07-10T15:17:21.634255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d25b4b7e-9d5e-4b28-81af-b11a1bb86f4f · outbound

This paper cites an unresolved cited work.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Unresolved cited work

Reference 17

Resolution: verified exact; arxiv_id, observed 2026-07-10T15:17:21.620154Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4cd65644-2c62-41b8-9256-d8e6950bb078 · outbound

This paper cites 2023 , url =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width 2023 , url =

Reference 18

Resolution: verified exact; arxiv_id, observed 2026-07-10T15:17:21.649956Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f04b73f1-901c-46a1-a31c-23ca36008c60 · outbound

This paper cites Bouritsas, F.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Bouritsas, F

Reference 19

Resolution: verified exact; arxiv_id, observed 2026-07-10T15:17:21.661517Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7fc1f9b2-8bd7-4e73-ab09-6fe0df8632f9 · outbound

This paper cites Proceedings of the ACM on Management of Data , volume=.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Proceedings of the ACM on Management of Data , volume=

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.938901Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 63971147-414d-4403-a02a-88b44e991e7a · outbound

This paper cites and Lander, E.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width and Lander, E

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.940686Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5ee4aaab-5adc-4cee-beca-22f1f7e0b9c2 · outbound

This paper cites The Complexity of Homomorphism Indistinguishability , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width The Complexity of Homomorphism Indistinguishability , booktitle =

Reference 22

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.655386Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b0182f62-03f8-4308-87b1-ab40479dc2bb · outbound

This paper cites Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity , year =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity , year =

Reference 23

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.653643Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 41e335e1-5559-4696-8b2d-4e29971087f5 · outbound

This paper cites An Algorithmic Meta Theorem for Homomorphism Indistinguishability , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width An Algorithmic Meta Theorem for Homomorphism Indistinguishability , booktitle =

Reference 24

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.657031Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 71e6aab0-4d33-48cd-921d-d4ad1af78261 · outbound

This paper cites Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors , booktitle =

Reference 25

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.603798Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2f2c1b59-4f66-42a9-ab72-0efb3c2dcc24 · outbound

This paper cites On Homomorphism Indistinguishability and Hypertree Depth , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width On Homomorphism Indistinguishability and Hypertree Depth , booktitle =

Reference 26

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.600295Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 33bed962-bba5-436d-8a56-66deef5463c6 · outbound

This paper cites Roberson and Tim Seppelt and Peter Zeman , editor =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Roberson and Tim Seppelt and Peter Zeman , editor =

Reference 27

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.629644Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 103f34de-41c1-417d-a7c2-7d40a100b00e · outbound

This paper cites Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing , booktitle =

Reference 28

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.647388Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f582ddf8-f40d-443c-a2ad-82f3008976ac · outbound

This paper cites 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =

Reference 29

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T15:17:21.673841Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 0c0ee9fe-d4bd-4b69-9e8c-759348236f7f · outbound

This paper cites Lasserre Hierarchy for Graph Isomor- phism and Homomorphism Indistinguishability.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Lasserre Hierarchy for Graph Isomor- phism and Homomorphism Indistinguishability

Reference 30

Resolution: metadata mismatch; doi, observed 2026-07-10T15:17:21.613071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 455ca90c-73c7-4c74-95ea-38ee9282cd02 · outbound

This paper cites Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width

Reference 31

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.621886Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 59a9556e-cbca-4704-b376-54091aef434d · outbound

This paper cites On recognizing graphs by numbers of homomorphisms.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width On recognizing graphs by numbers of homomorphisms

Reference 32

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.671285Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 642433f1-a337-4fc8-8258-69ea6af289d7 · outbound

This paper cites Semideﬁnite Progr ams on Sparse Random Graphs and /T_heir Application to Community Detection.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Semideﬁnite Progr ams on Sparse Random Graphs and /T_heir Application to Community Detection

Reference 33

Resolution: metadata mismatch; arxiv_id, observed 2026-07-10T15:17:21.669638Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c0a66da5-8ff8-41d2-85f6-695e58e7cce5 · outbound

This paper cites 2012 , publisher=.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width 2012 , publisher=

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.935216Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 28989c8b-d612-4d07-8368-46af82969400 · outbound

This paper cites The Twelfth International Conference on Learning Representations , year=.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width The Twelfth International Conference on Learning Representations , year=

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.937124Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 9d462961-8001-4cf2-95aa-f6323d67cc42 · outbound

This paper cites An optimal lower bound on the number of variables for graph identification.Combinatorica, 12(4):389–410.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width An optimal lower bound on the number of variables for graph identification.Combinatorica, 12(4):389–410

Reference 36

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.663375Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 22ec4ace-e87c-49c1-995a-2c745b61ca29 · outbound

This paper cites 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) , pages =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) , pages =

Reference 37

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.625304Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 679ddfd0-b570-4fcc-9373-4f9ab0a1a254 · outbound

This paper cites A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus , booktitle =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus , booktitle =

Reference 38

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.602046Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 81a02c14-87e8-4365-96a5-0bcfa8bfa0ff · outbound

This paper cites Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe

Reference 39

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.605557Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c44d8cf2-baa3-4006-b847-a95d122a3187 · outbound

This paper cites Bonsma and Martin Grohe , title =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Bonsma and Martin Grohe , title =

Reference 40

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.607219Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 810d5558-181c-4d1f-9b31-656c70ae43e7 · outbound

This paper cites Random Graph Isomorphism , journal =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Random Graph Isomorphism , journal =

Reference 41

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.631477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 793a950f-520a-4255-b779-56a96dfff8e4 · outbound

This paper cites an unresolved cited work.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Unresolved cited work

Reference 42

Resolution: unresolved; raw_fallback, observed 2026-07-10T15:17:21.942642Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ed0b055f-5268-4d51-96cb-f37615bd661c · outbound

This paper cites The W eisfeiler- L eman dimension of planar graphs is at most 3.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width The W eisfeiler- L eman dimension of planar graphs is at most 3

Reference 43

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.651728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 71ab9452-1544-44a8-bb89-25b85ad0ec96 · outbound

This paper cites Kriege and Martin Grohe and Matthias Fey and Karsten M.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Kriege and Martin Grohe and Matthias Fey and Karsten M

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.949807Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation dbc668d2-c249-443b-92cf-f7d85ad73075 · outbound

This paper cites 2026 , url =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width 2026 , url =

Reference 45

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.642131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 71b618e4-fa9f-413a-ad74-346b300ffb22 · outbound

This paper cites Acta Mathematica Hungarica , volume=.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Acta Mathematica Hungarica , volume=

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T15:17:21.933610Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ee2fade7-5a37-46b1-8f10-abc79493e204 · outbound

This paper cites Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems , url =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems , url =

Reference 47

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.638771Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 19725f17-eb36-462d-ba91-40ded48c716d · outbound

This paper cites 2026 , issue_date =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width 2026 , issue_date =

Reference 48

Resolution: verified exact; doi, observed 2026-07-10T15:17:21.643880Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b83fb573-663d-4033-925e-46e3e645cdd6 · outbound

This paper cites Fractional covers of hypergraphs with bounded multi-intersection , volume =.

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width Fractional covers of hypergraphs with bounded multi-intersection , volume =

Reference 49

Resolution: verified exact; arxiv_id, observed 2026-07-10T15:17:21.627982Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers