Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Beaudou, Laurent, Quintero, Guillermo Gamboa
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021)

Erdős-Pósa property of tripods in directed graphs
by: Briański, Marcin, et al.
Published: (2024)

Equitable coloring of large bipartite graphs
by: Nikabadi, Amir
Published: (2026)

Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

On de Bruijn Rings and Families of Almost Perfect Maps
by: Stelldinger, Peer
Published: (2024)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
by: Beaudou, Laurent, et al.
Published: (2016)

Representation number of word-representable co-bipartite graph
by: Das, Biswajit, et al.
Published: (2025)

Erdős--Pósa property of cycles that are far apart
by: Dujmović, Vida, et al.
Published: (2024)

Onion De Bruijn Sequences: Fixed-Window Counting by Growing the Alphabet
by: Genosar, Dor, et al.
Published: (2019)

Tight bound for the Erdős-Pósa property of tree minors
by: Dujmović, Vida, et al.
Published: (2024)

Chemically inspired Erdős-Rényi oriented hypergraphs
by: Garcia-Chung, Angel, et al.
Published: (2023)

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
by: Sawada, J., et al.
Published: (2023)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
by: Chekan, Vera, et al.
Published: (2024)

Minimum blocking sets for families of partitions
by: Quintero, Guillermo Gamboa, et al.
Published: (2025)

Balanced colorings of Erdős-Rényi hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2025)

On extremal factors of de Bruijn-like graphs
by: Álvarez, Nicolás, et al.
Published: (2023)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
by: Adak, Rajat, et al.
Published: (2025)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
by: Gabric, Daniel, et al.
Published: (2026)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
by: Kupavskii, Andrey, et al.
Published: (2025)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
by: Castelo, Emanuel, et al.
Published: (2025)

Well-mixing vertices and almost expanders
by: Chakraborti, Debsoumya, et al.
Published: (2021)

Characterization of Split Comparability Graphs
by: Dwary, Tithi, et al.
Published: (2025)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Representation Number of Word-Representable Split Graphs
by: Dwary, Tithi, et al.
Published: (2025)

Exact Biclique Partition number of Split Graphs
by: Babu, Anand, et al.
Published: (2025)

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
by: Anand, Bijo S., et al.
Published: (2025)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)

Word-Representability of Split Graphs with Independent Set of Size 4
by: Roy, Suchanda, et al.
Published: (2025)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs
by: Cao, Yixin, et al.
Published: (2024)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)