Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property

Abstract

In this note, 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.