The following pages link to Abdulkarim M. Magomedov (Q501999):
Displayed 15 items.
- Successive partition of edges of bipartite graph into matchings (Q502001) (← links)
- (Q650433) (redirect page) (← links)
- Existence of a trade-off factorization of a partially \(4\)-homogeneous graph (Q650434) (← links)
- Condensing timetables with target date divisible by each instructor's number of class hours (Q1033890) (← links)
- Conditions for the existence of continuous schedules of duration five (Q1759070) (← links)
- Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem (Q1947805) (← links)
- On interval \(\Delta\)-coloring of bipartite graphs (Q2356135) (← links)
- All face 2-colorable d-angulations are Gr\"unbaum colorable (Q2809952) (← links)
- On the edge colouring of bipartite graphs (Q3225861) (← links)
- Defragmentation of permutation tables with four columns (Q3225893) (← links)
- A continuous timetable with m, m – 2, or 2 instructor’s class hours (Q4917399) (← links)
- (Q5150426) (← links)
- (Q5150675) (← links)
- CHAIN STRUCTURES IN SCHEDULES TASKS (Q5150747) (← links)
- MUTUALLY-RECURSIVE FORMULAS FOR ENUMERATING PARTITIONS OF THE RECTANGLE (Q5151296) (← links)