On the harmonious chromatic number of graphs

DOI10.1007/S40590-024-00632-5zbMATH Open1542.0505MaRDI QIDQ6564837

Gabriela Araujo-Pardo, Christian Rubio-Montiel, Juan José Montellano-Ballesteros, Mika Olsen

Publication date: 1 July 2024

Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

zbMATH Keywords

circulant graphLevi graphdiameter twoharmonious homomorphism

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• On the combinatorial problems which I would most like to see solved
• The harmonious coloring number of a graph
• On the harmonious chromatic number of a graph
• On line colorings of finite projective spaces
• Dynamic cage survey
• On the Harmonious Coloring of Graphs
• Achromatic and Harmonious Colorings of Circulant Graphs
• The 4-girth-thickness of the complete multipartite graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On the harmonious chromatic number of graphs

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