ON GRAPH FOLDING AND MOBILE RADIO FREQUENCY ASSIGNMENT

DOI10.21608/joems.2018.2914.1049zbMath1435.05087OpenAlexW2906830509WikidataQ128623303 ScholiaQ128623303MaRDI QIDQ5220284

Hesham Rafat, Fatma Salama

Publication date: 16 March 2020

Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21608/joems.2018.2914.1049

zbMATH Keywords

chromatic numberfoldingvertex-coloring

Mathematics Subject Classification ID

Applications of graph theory (05C90) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colouring graphs when the number of colours is almost the maximum degree
• Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
• Total coloring of rooted path graphs
• List 3-dynamic coloring of graphs with small maximum average degree
• Colorings of plane graphs: a survey
• On the chromatic number of regular graphs of matrix algebras
• Edge irredundant colorings in graphs
• On some applications of the selective graph coloring problem
• Isometric folding of Riemannian manifolds
• Folding and coloring problems in mathematics and physics

This page was built for publication: ON GRAPH FOLDING AND MOBILE RADIO FREQUENCY ASSIGNMENT