ON LOCALLY-BALANCED 2-PARTITIONS OF BIPARTITE GRAPHS
From MaRDI portal
Publication:5100156
DOI10.46991/PYSU:A/2020.54.3.137zbMath1493.05245MaRDI QIDQ5100156
A. H. Gharibyan, Petros A. Petrosyan
Publication date: 29 August 2022
Published in: Proceedings of the YSU A: Physical and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/uzeru751
bipartite graphNP-completenesssubcubic bipartite graphbiregular bipartite graphlocally-balanced 2-partition
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs
- Algorithmic approach to the satisfactory graph partitioning problem
- Equitable colorings of outerplanar graphs
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat}
- The satisfactory partition problem
- The Subgraph Problem
- Equitable Coloring
This page was built for publication: ON LOCALLY-BALANCED 2-PARTITIONS OF BIPARTITE GRAPHS