DOI · e01.org

The incidence chromatic number of toroidal grids

Éric Sopena, Jiaojiao Wu · Discussiones Mathematicae Graph Theory · 2012

  • DOI 10.7151/dmgt.1663
  • Publisher De Gruyter Open
  • Type article
  • Issued 2012

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Discussiones Mathematicae Graph Theory · De Gruyter Open · article · 2012

Abstract

An incidence in a graph G is a pair (v, e) with v ∈ V (G) and e ∈ E(G), such that v and e are incident.Two incidences (v, e) and (w, f ) are adjacent if v = w, or e = f , or the edge vw equals e or f .The incidence chromatic number of G is the smallest k for which there exists a mapping from the set of incidences of G to a set of k colors that assigns distinct colors to adjacent incidences.In this paper, we prove that the incidence chromatic number of the toroidal grid T m,n = C m 2C n equals 5 when m, n ≡ 0 (mod 5) and 6 otherwise.

Open the resolved locator · 10.7151/dmgt.1663

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-19 20:03 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.7151/dmgt.1663
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.