The regular number of a graph

DOI10.1080/09720529.2012.10698371MaRDI QIDQ4648998zbMATH OpenOpenAlexFDO

Authors 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, http://www.connectjournals.com/file_html_pdf/1439902H_05_JDMSC_T65_15-2-3_pp149-157a.pdf

zbMATH Keywords

chromatic numberedge partitionmaximum degreeregular number of a graph

Mathematics Subject Classification ID

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

Abstract: Let $G$ be a simple undirected graph. The regular number of $G$ is defined to be the minimum number of subsets into which the edge set of $G$ can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain the regular number of some families of graphs and discuss some general bounds on this parameter. Also, some of the lower or upper bounds proved in cite{Kulli:Janakiram:Iyer:2001} are shown here to hold with equality.

Recommendations

• Regular number of a graph
• scientific article; zbMATH DE number 841567
• scientific article; zbMATH DE number 4148119
• scientific article; zbMATH DE number 3887746
• scientific article; zbMATH DE number 2151975
• About regular graphs
• scientific article; zbMATH DE number 2192159
• scientific article; zbMATH DE number 2113521
• The decycling number of regular graphs
• scientific article; zbMATH DE number 3966102

Cites work

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

Cited in

(12)

• Bipartite regulation numbers
• Regular number of a graph
• Regular graphs with maximum forest number
• scientific article; zbMATH DE number 3887746 (Why is no real title available?)
• scientific article; zbMATH DE number 3843805 (Why is no real title available?)
• scientific article; zbMATH DE number 4148119 (Why is no real title available?)
• On some regularities of graphs. II.
• scientific article; zbMATH DE number 4057566 (Why is no real title available?)
• scientific article; zbMATH DE number 4066952 (Why is no real title available?)
• scientific article; zbMATH DE number 841567 (Why is no real title available?)
• On the complexity of deciding whether the regular number is at most two
• Algorithmic complexity of weakly semiregular partitioning and the representation number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648998)