Mengerian graphs: characterization and recognition

DOI10.1016/j.jcss.2023.103467arXiv2208.06517MaRDI QIDQ6078288

Unnamed Author, Allen Ibiapina

Publication date: 24 October 2023

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.06517

zbMATH Keywords

connectivityMenger's theoremtemporal graphstopological minorstemporal paths

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating maximal cliques in link streams with durations
• Temporal network optimization subject to connectivity constraints
• Finding temporal paths under waiting time constraints
• The complexity of finding small separators in temporal graphs
• Mengerian temporal graphs revisited
• Edge-disjoint branchings in temporal digraphs
• Eulerian walks in temporal graphs
• As Time Goes By: Reflections on Treewidth for Temporal Graphs
• Finding topological subgraphs is fixed-parameter tractable
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Connectivity and inference problems for temporal networks
• Temporal graph classes: a view through temporal separators
• Edge exploration of temporal graphs

This page was built for publication: Mengerian graphs: characterization and recognition