Highly connected graphs have highly connected spanning bipartite subgraphs

DOI10.37236/12084arXiv2403.15599MaRDI QIDQ6131741FDOQ6131741

Raphael Yuster

Publication date: 18 April 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreelarge girthdisjoint cyclescyclic vertex-connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

This page was built for publication: Highly connected graphs have highly connected spanning bipartite subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131741)