Coloring graphs with no induced five-vertex path or gem | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Coloring graphs with no induced five-vertex path or gem

Identifier:nobleid.org/w1/20260515/DCD06259

Type:Preprint

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

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

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Frédéric Maffray

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy