Deciding whether a planar graph has a cubic subgraph is NP-complete

  • Authors:
  • Iain A. Stewart

  • Affiliations:
  • -

  • Venue:
  • Discrete Mathematics
  • Year:
  • 1994

Quantified Score

Hi-index 0.06

Visualization

Abstract