Successive partition of edges of bipartite graph into matchings
DOI10.1515/DMA-2016-0029zbMATH Open1352.05152OpenAlexW2564918610MaRDI QIDQ502001FDOQ502001
Authors: Abdulkarim M. Magomedov, Tagir A. Magomedov 
Publication date: 10 January 2017
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2016-0029
Recommendations
- scientific article; zbMATH DE number 1990669
- Partition the vertices of a graph into induced matchings
- Graphs whose edge set can be partitioned into maximum matchings
- scientific article; zbMATH DE number 67678
- On the bipartition of graphs
- Splitting Edge Partitions of Graphs
- Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
- Matchings Including or Excluding Certain Edge Sets in Bipartite Graphs
- Bipartization of graphs
- Some Results on Matching in Bipartite Graphs
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- The NP-Completeness of Edge-Coloring
- Interval colorings of edges of a multigraph
- Title not available (Why is that?)
- Conditions for the existence of continuous schedules of duration five
- Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem
- A continuous timetable with m, m – 2, or 2 instructor’s class hours
Cited In (3)
This page was built for publication: Successive partition of edges of bipartite graph into matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502001)
