Neighborhood balanced colorings of graphs

DOI10.1007/S00373-024-02766-9MaRDI QIDQ6131297zbMATH OpenOpenAlexFDO

Authors Bryan Freyberg, Alison Marr

Publication date 4 April 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00373-024-02766-9

zbMATH Keywords

cordial labelingred-blue coloringvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Some results of regular graphs on the existence of balanced partition
• On locally-balanced 2-partitions of some classes of graphs
• On balanceable and simply balanceable regular graphs
• On the balanceability of some graph classes
• scientific article; zbMATH DE number 125598

Cites work

• A dynamic survey of graph labeling
• Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
• scientific article; zbMATH DE number 3997850 (Why is no real title available?)
• Isomorphism between circulants and Cartesian products of cycles

Cited in

(3)

• On balanceable and simply balanceable regular graphs
• Balanced zero-neighborhood labeling of generalized Petersen graphs
• Closed neighborhood balanced coloring of graphs

This page was built for publication: Neighborhood balanced colorings of graphs

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