Pages that link to "Item:Q1186590"
From MaRDI portal
The following pages link to A constructive proof of Vizing's theorem (Q1186590):
Displaying 40 items.
- Edge coloring: a natural model for sports scheduling (Q323273) (← links)
- Tight bound for matching (Q431927) (← links)
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited (Q436862) (← links)
- A constructive proof of Kirszbraun's theorem (Q635637) (← links)
- Local algorithms for edge colorings in UDGs (Q638541) (← links)
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← links)
- Approximating the maximum 3-edge-colorable subgraph problem (Q1043590) (← links)
- Decompositions for the edge colouring of reduced indifference graphs. (Q1401296) (← links)
- A new neighborhood structure for round robin scheduling problems (Q1651632) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- A new multi-resolution parallel framework for SPH (Q1986949) (← links)
- Incidence coloring of mycielskians with fast algorithm (Q2043007) (← links)
- On the hardness of determining the irregularity strength of graphs (Q2089679) (← links)
- Chromatic index of dense quasirandom graphs (Q2171027) (← links)
- An exact algorithm for the edge coloring by total labeling problem (Q2178329) (← links)
- Assigning times to minimise reachability in temporal graphs (Q2208254) (← links)
- Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) (← links)
- A new tool for proving Vizing's theorem (Q2449145) (← links)
- A brief proof of the full completeness of Shin's Venn diagram proof system (Q2499299) (← links)
- On Vizing's edge colouring question (Q2680572) (← links)
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343) (← links)
- A Simple Construction to Prove Mycielski’s Theorem (Q3120217) (← links)
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (Q3196420) (← links)
- Quantum Monte Carlo annealing with multi-spin dynamics (Q3303042) (← links)
- (Q3483288) (← links)
- Random perfect graphs (Q4625032) (← links)
- A constructive proof of Masser’s Theorem (Q4965256) (← links)
- MPI+X: task-based parallelisation and dynamic load balance of finite element assembly (Q5031506) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- A Constructive Proof of the Existence of Viterbi Processes (Q5281552) (← links)
- Distributed link scheduling in wireless networks (Q5858167) (← links)
- Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
- A constructive proof of the Chang-Marshall theorem (Q5916432) (← links)
- Very fast parallel algorithms for approximate edge coloring (Q5929308) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
- An alternating direction method of multipliers for solving user equilibrium problem (Q6113451) (← links)
- Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6122608) (← links)
- Borel Vizing's theorem for graphs of subexponential growth (Q6654016) (← links)
