Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T14:49:40.066119Z
Paper Citation Record · LEDGER
Finding d-Cuts in Claw-free Graphs
As of 8 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 1 inbound Pith citation observation for arXiv:2505.17993.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T13:30:34.962167Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-07T13:30:37.951829Z
Reference resolution
24 of 24 outbound references displayed
- verified exact2
- verified fuzzy16
- unresolved6
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation c7d16be4-d83e-475c-b6db-d03e937251e0 · outbound
This paper cites an unresolved cited work.
Finding d-Cuts in Claw-free Graphs Unresolved cited work
Reference 1
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T14:49:46.248950Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation aecf9b02-e62c-44d6-9c37-cfd6c6b80cc6 · outbound
This paper cites an unresolved cited work.
Finding d-Cuts in Claw-free Graphs Unresolved cited work
Reference 2
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T14:49:45.952821Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ffbe5e0e-d45b-4bdb-943a-64d95e356e72 · outbound
This paper cites Internal partitions of regular graphs.
Finding d-Cuts in Claw-free Graphs Internal partitions of regular graphs
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:45.700179Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation cfb18af0-ffdb-440b-b78d-bf8fd5a81264 · outbound
This paper cites Cutting B arnette graphs perfectly is hard.
Finding d-Cuts in Claw-free Graphs Cutting B arnette graphs perfectly is hard
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:45.421309Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 25204af1-f68a-451d-842b-7610dcf803e9 · outbound
This paper cites an unresolved cited work.
Finding d-Cuts in Claw-free Graphs Unresolved cited work
Reference 5
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T14:49:45.193123Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ab7b323d-02b6-4caf-9090-bec84adb8819 · outbound
This paper cites The complexity of the P erfect M atching- C ut problem.
Finding d-Cuts in Claw-free Graphs The complexity of the P erfect M atching- C ut problem
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:44.933526Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 35341025-366e-4793-bfff-1be0f063e432 · outbound
This paper cites Matching C ut in graphs with large minimum degree.
Finding d-Cuts in Claw-free Graphs Matching C ut in graphs with large minimum degree
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:44.672477Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 2aba5cb9-f036-47fd-bc5d-7de5e6e2c9c8 · outbound
This paper cites Recognizing decomposable graphs.
Finding d-Cuts in Claw-free Graphs Recognizing decomposable graphs
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:43.818492Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ad30ed50-d384-44e6-ad86-c09617048102 · outbound
This paper cites A forbidden subgraph study for cut problems on graphs permitting loops and multiedges.
Finding d-Cuts in Claw-free Graphs A forbidden subgraph study for cut problems on graphs permitting loops and multiedges
Reference 9
- Resolution
- verified exact
- raw_fallback, observed 2026-08-07T14:49:40.886509Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 93152327-1c0f-4041-9fe5-8fc32b5ff9f9 · outbound
This paper cites Matching cuts in graphs of high girth and H -free graphs.
Finding d-Cuts in Claw-free Graphs Matching cuts in graphs of high girth and H -free graphs
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:43.568569Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4fba6d8a-da39-4016-b3af-4e5a9cd82775 · outbound
This paper cites Golovach, Christian Komusiewicz, Dieter Kratsch, and Van Bang Le.
Finding d-Cuts in Claw-free Graphs Golovach, Christian Komusiewicz, Dieter Kratsch, and Van Bang Le
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:43.295638Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e38fb892-c1ed-4d78-bacc-0d5a2c6ea07e · outbound
This paper cites Finding cuts of bounded degree: complexity, F P T and exact algorithms, and kernelization.
Finding d-Cuts in Claw-free Graphs Finding cuts of bounded degree: complexity, F P T and exact algorithms, and kernelization
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:43.052776Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d960aee7-da43-455b-83ca-7abbbbc5ef92 · outbound
This paper cites an unresolved cited work.
Finding d-Cuts in Claw-free Graphs Unresolved cited work
Reference 13
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T14:49:42.869450Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 0231ac2d-3dad-4ed8-aec1-d7b9477e4d12 · outbound
This paper cites Partitioning graphs into generalized dominating sets.
Finding d-Cuts in Claw-free Graphs Partitioning graphs into generalized dominating sets
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:42.701692Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e460c046-79ee-4cea-ae3f-0d788ea87fc3 · outbound
This paper cites Matching C ut: Kernelization, single-exponential time FPT , and exact exponential algorithms.
Finding d-Cuts in Claw-free Graphs Matching C ut: Kernelization, single-exponential time FPT , and exact exponential algorithms
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:42.567641Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 73c9779b-90b2-4755-b410-d67135cd6d20 · outbound
This paper cites Algorithms solving the M atching C ut problem.
Finding d-Cuts in Claw-free Graphs Algorithms solving the M atching C ut problem
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:42.389839Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 92ca1991-64fc-410d-b9ea-a9996d81172a · outbound
This paper cites Complexity results for matching cut problems in graphs without long induced paths.
Finding d-Cuts in Claw-free Graphs Complexity results for matching cut problems in graphs without long induced paths
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:42.230327Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4720f32d-7d48-4d61-957f-24a5ddb58605 · outbound
This paper cites The P erfect M atching C ut problem revisited.
Finding d-Cuts in Claw-free Graphs The P erfect M atching C ut problem revisited
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:42.058509Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 05d27cc2-41de-43f5-9391-9e1ec705dec3 · outbound
This paper cites Finding minimum matching cuts in H -free graphs and graphs of bounded radius and diameter.
Finding d-Cuts in Claw-free Graphs Finding minimum matching cuts in H -free graphs and graphs of bounded radius and diameter
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T14:49:39.431825Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1cb17970-d220-461e-8037-3e6591dddc14 · outbound
This paper cites Finding d -cuts in graphs of bounded diameter, graphs of bounded radius and H -free graphs.
Finding d-Cuts in Claw-free Graphs Finding d -cuts in graphs of bounded diameter, graphs of bounded radius and H -free graphs
Reference 20
- Resolution
- verified exact
- raw_fallback, observed 2026-08-07T14:49:40.474419Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation c429903a-c922-4ece-8c55-33b74d692447 · outbound
This paper cites On the complexity of M atching C ut for graphs of bounded radius and H -free graphs.
Finding d-Cuts in Claw-free Graphs On the complexity of M atching C ut for graphs of bounded radius and H -free graphs
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:41.801547Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 79393ffe-27d5-4a15-b124-a331d2104356 · outbound
This paper cites Finding matching cuts in H -free graphs.
Finding d-Cuts in Claw-free Graphs Finding matching cuts in H -free graphs
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:41.630342Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation fea0b27a-bda3-4e30-8521-13f6aebba40f · outbound
This paper cites Dichotomies for maximum matching cut: H -freeness, bounded diameter, bounded radius.
Finding d-Cuts in Claw-free Graphs Dichotomies for maximum matching cut: H -freeness, bounded diameter, bounded radius
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T14:49:41.530553Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f8bc0056-a18e-49bd-83c3-1865662691cb · outbound
This paper cites an unresolved cited work.
Finding d-Cuts in Claw-free Graphs Unresolved cited work
Reference 24
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T14:49:41.358632Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Pith citing papers
Observation f237e18b-697a-4380-8e00-a3df0df7ad7d · inbound
Finding $d$-Cuts in Probe $H$-Free Graphs cites this paper.
Finding $d$-Cuts in Probe $H$-Free Graphs Finding d-Cuts in Claw-free Graphs
Reference 1
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T13:30:38.037439Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.