Splitting Vertices of Bipartite Graphs Preserves de Bruijn–Erdős Property

Discrete Mathematics Letters 2026 Open access

Read full text
Authors: Laurent Beaudou, Guillermo Gamboa Quintero
DOI: 10.47443/dml.2025.202
Cited by: 0

Abstract

In this article, we prove that every graph obtained from a bipartite graph by iteratively splitting vertices into two adjacent twins has the de Bruijn-Erdős property.

Fields of Study & Subjects

Limits and Structures in Graph Theory Advanced Graph Theory Research Graph theory and applications

Publication details

Journal / source
Discrete Mathematics Letters
Publication date
22 May 2026
Language
EN