pith. sign in

Title resolution pending

· 2002

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.CO 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

A note on cycles in cyclically $4$-edge-connected cubic planar graphs

math.CO · 2026-05-05 · unverdicted · novelty 5.0 · 2 refs

Removing two adjacent vertices from a cyclically 4-edge-connected cubic planar graph Y yields a graph H that contains a cycle of length between k and 3k/2 if its circumference is at least even k >= 4, implying that the line graph of Y has cycles of every length l in {3} union {5 to |V|-1} avoiding a

citing papers explorer

Showing 1 of 1 citing paper.

  • A note on cycles in cyclically $4$-edge-connected cubic planar graphs math.CO · 2026-05-05 · unverdicted · none · ref 5 · 2 links

    Removing two adjacent vertices from a cyclically 4-edge-connected cubic planar graph Y yields a graph H that contains a cycle of length between k and 3k/2 if its circumference is at least even k >= 4, implying that the line graph of Y has cycles of every length l in {3} union {5 to |V|-1} avoiding a