The regular number of a graph

DOI10.1080/09720529.2012.10698371zbMath1254.05083arXiv1111.6836OpenAlexW2963670396MaRDI QIDQ4648998

Ashwin Ganesan, Radha R Iyer

Publication date: 16 November 2012

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.6836

zbMATH Keywords

chromatic numbermaximum degreeedge partitionregular number of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On the complexity of deciding whether the regular number is at most two ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number

Cites Work

• Regular number of a graph
• The NP-Completeness of Edge-Coloring

This page was built for publication: The regular number of a graph