Neighborhood 3-Balanced Graphs
Graphs and Combinatorics · 2026-06 · 42 (3)
DOI: 10.1007/s00373-026-03038-4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 05.05.2026. Verfasst von Mitchell Minyard und 1 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
A graph is said to be neighborhood 3-balanced if there exists a vertex labeling with three colors so that each vertex has an equal number of neighbors of each color. We give order constraints on 3-balanced graphs, determine which generalized Petersen and Pappus graphs are 3-balanced, discuss when being 3-balanced is preserved under various graph constructions, give two general characterizations of cubic 3-balanced graphs, and classify cubic 3-balanced graphs of small order.
Zitieren
APA
Minyard, M., & Sepanski, M. R. (2026). Neighborhood 3-Balanced Graphs. Graphs and Combinatorics, 42(3). https://doi.org/10.1007/s00373-026-03038-4
Vancouver
Minyard M, Sepanski MR. Neighborhood 3-Balanced Graphs. Graphs and Combinatorics. 2026;42(3). doi:10.1007/s00373-026-03038-4
BibTeX
@article{Minyard2026,
author = {Minyard, Mitchell and Sepanski, Mark R.},
title = {Neighborhood 3-Balanced Graphs},
journal = {Graphs and Combinatorics},
year = {2026},
volume = {42},
number = {3},
doi = {10.1007/s00373-026-03038-4}
}
EUVIMED