pith. sign in

Title resolution pending

· 2019 · DOI 10.1016/j.disc.2019.01.025

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

1 Pith paper citing it
open at publisher 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

Subcubic $K_4$-minor-free graphs without crumby colorings

math.CO · 2026-05-06 · unverdicted · novelty 7.0

Counterexamples disprove the conjecture that every K4-minor-free graph has a crumby coloring, with the smallest connected one having 18 vertices and a 2-connected one having 40 vertices.

citing papers explorer

Showing 1 of 1 citing paper.

  • Subcubic $K_4$-minor-free graphs without crumby colorings math.CO · 2026-05-06 · unverdicted · none · ref 1

    Counterexamples disprove the conjecture that every K4-minor-free graph has a crumby coloring, with the smallest connected one having 18 vertices and a 2-connected one having 40 vertices.