Bipartite spanning sub(di)graphs induced by 2‐partitions

DOI10.1002/jgt.22444zbMath1425.05127arXiv1707.09400OpenAlexW2905129508MaRDI QIDQ5241609

Frédéric Havet, Anders Yeo, Stéphane Bessy, Jörgen Bang-Jensen

Publication date: 31 October 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Eulerian graph2-partitionstrong spanning subdigraphminimum out-degreespanning bipartite subdigraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (4)

Graphs with disjoint 2-dominating sets ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties ⋮ Classes of intersection digraphs with good algorithmic properties

This page was built for publication: Bipartite spanning sub(di)graphs induced by 2‐partitions