How many disjoint 2-edge paths must a cubic graph have? | NobleID

Knowledge Graph Citation Graph Docs

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

How many disjoint 2-edge paths must a cubic graph have?

Identifier:nobleid.org/w1/20260515/89DFFEB2

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/89DFFEB2.svg?ark=w1%2F20260515%2F89DFFEB2)](https://nobleid.org/work/w1/20260515/89DFFEB2)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

KelmansAlexander

Claim authorship of this work

info@nobleid.org

About Terms Policy Persistence & Resolver Service Policy Pricing