EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Neighborhood Balanced Colorings of Graphs

Bryan Freyberg, Alison Marr

Graphs and Combinatorics · 2024-04 · 40 (2)

DOI: 10.1007/s00373-024-02766-9 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 26.03.2024. Verfasst von Bryan Freyberg und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 5 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Southwestern University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Given a simple graph G , we ask when V ( G ) may be partitioned into two sets such that every vertex has an equal number of neighbors from each set. We establish a number of results for common families of graphs and completely classify 4-regular circulants which posses this property.

Förderung

  • Southwestern University

Zitieren

APA

Freyberg, B., & Marr, A. (2024). Neighborhood Balanced Colorings of Graphs. Graphs and Combinatorics, 40(2). https://doi.org/10.1007/s00373-024-02766-9

Vancouver

Freyberg B, Marr A. Neighborhood Balanced Colorings of Graphs. Graphs and Combinatorics. 2024;40(2). doi:10.1007/s00373-024-02766-9

BibTeX
@article{Freyberg2024,
  author = {Freyberg, Bryan and Marr, Alison},
  title = {Neighborhood Balanced Colorings of Graphs},
  journal = {Graphs and Combinatorics},
  year = {2024},
  volume = {40},
  number = {2},
  doi = {10.1007/s00373-024-02766-9}
}
Kostenlos starten →