Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T15:07:34.641102Z
Paper Citation Record · LEDGER
On the maximum number of minimal connected dominating sets in convex bipartite graphs
As of 17 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:1908.02174.
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-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
20 of 20 outbound references displayed
- verified exact2
- verified fuzzy8
- unresolved10
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 956afdfd-60d5-47b2-98c9-f2539444afbb · outbound
This paper cites Below all subsets for minimal connected dominating set.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Below all subsets for minimal connected dominating set
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:07:35.006328Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation e9a73198-4d31-4529-8356-0cb21ff9d77a · outbound
This paper cites an unresolved cited work.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Unresolved cited work
Reference 2
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:07:34.992073Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 83e69c31-ee58-4d7b-9b60-bebbf1f5bbca · outbound
This paper cites an unresolved cited work.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Unresolved cited work
Reference 3
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:07:34.978165Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation e0e3b19c-4dde-4d2c-985c-744b699b3657 · outbound
This paper cites an unresolved cited work.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Unresolved cited work
Reference 4
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:07:34.964107Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 67ee5a96-5fa1-4f60-be5b-e2f4b2013ea5 · outbound
This paper cites an unresolved cited work.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Unresolved cited work
Reference 5
- Resolution
- verified exact
- doi, observed 2026-08-14T15:07:34.712196Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation bffe4b31-8c01-4aec-abc7-0dd24c0fd0ca · outbound
This paper cites an unresolved cited work.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Unresolved cited work
Reference 6
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:07:34.949850Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c671d66d-cbba-4d26-b7d2-59779f5484d0 · outbound
This paper cites Hedetniemi J.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Hedetniemi J
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:07:34.935109Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 278a3d03-47b5-4c97-a928-d4ebdeba704d · outbound
This paper cites The NP-completeness of steiner tree and dominating set for chordal bipartite graphs.
On the maximum number of minimal connected dominating sets in convex bipartite graphs The NP-completeness of steiner tree and dominating set for chordal bipartite graphs
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:07:34.921142Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 52e078d5-49ac-44c8-a869-722048a9f6b9 · outbound
This paper cites ACM Trans.
On the maximum number of minimal connected dominating sets in convex bipartite graphs ACM Trans
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:07:34.590515Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8cd94e06-5a61-4b7c-be2d-bce08696f127 · outbound
This paper cites an unresolved cited work.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Unresolved cited work
Reference 10
- Resolution
- verified exact
- doi, observed 2026-08-14T15:07:34.696996Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 3096f3e6-b61b-4e5b-be42-aee502943c25 · outbound
This paper cites Golovach, Dieter Kratsch, Mathieu Liedloff, and Mohamed Yosri Sayadi.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Golovach, Dieter Kratsch, Mathieu Liedloff, and Mohamed Yosri Sayadi
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:07:34.905942Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 12439bbc-df1d-4c89-9af8-d6f80be4c722 · outbound
This paper cites an unresolved cited work.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Unresolved cited work
Reference 12
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:07:34.604078Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation dc9f5095-c355-499d-89d2-a741cbe8d98e · outbound
This paper cites Moon , L.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Moon , L
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:07:34.889875Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 0fb0812b-511e-4416-baef-4bd48873fbdb · outbound
This paper cites an unresolved cited work.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Unresolved cited work
Reference 14
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:07:34.875453Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 17025d78-ff51-469d-9c1e-b44e9873df9f · outbound
This paper cites Brandst\" a dt, V.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Brandst\" a dt, V
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:07:34.860542Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9b8c0830-140c-4fe1-b4f2-66b1398a7c42 · outbound
This paper cites Texts in Theoretical Computer Science.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Texts in Theoretical Computer Science
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:07:34.622329Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d2a6e60c-3445-43f5-b81b-d6d5caa39f8f · outbound
This paper cites Golovach, Dieter Kratsch, and Mohamed Yosri Sayadi.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Golovach, Dieter Kratsch, and Mohamed Yosri Sayadi
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:07:34.846338Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 50da4582-9074-489a-9b4f-9d59d8cc83bb · outbound
This paper cites Golovach, Dieter Kratsch, Mathieu Liedloff, and Mohamed Yosri Sayadi.
On the maximum number of minimal connected dominating sets in convex bipartite graphs Golovach, Dieter Kratsch, Mathieu Liedloff, and Mohamed Yosri Sayadi
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:07:34.831986Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 91e96fa7-e54c-400a-85a4-6cd345de3929 · outbound
This paper cites , " * write output.state after.block = add.period write.
On the maximum number of minimal connected dominating sets in convex bipartite graphs , " * write output.state after.block = add.period write
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:07:34.635777Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b9688aaa-0df6-40c8-9a7b-589200ab408d · outbound
This paper cites write newline.
On the maximum number of minimal connected dominating sets in convex bipartite graphs write newline
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:07:34.641102Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.