"Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic ..."

Carsten Thomassen (1999)

> Home

Details and statistics

DOI: 10.1006/JCTB.1998.1868

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/Thomassen99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/Thomassen99
Carsten Thomassen:
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5. J. Comb. Theory B 75(1): 100-109 (1999)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.