Pages that link to "Item:Q1125951"
From MaRDI portal
The following pages link to Asymptotics of the chromatic index for multigraphs (Q1125951):
Displaying 32 items.
- On a limit of the method of Tashkinov trees for edge-colouring (Q297916) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- A superlocal version of Reed's conjecture (Q490262) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Clusters in a multigraph with elevated density (Q870066) (← links)
- The chromatic index of multigraphs that are nearly full (Q910411) (← links)
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture (Q968455) (← links)
- On the chromatic index of almost all graphs (Q1246431) (← links)
- On the stochastic independence properties of hard-core distributions (Q1272181) (← links)
- A sublinear bound on the chromatic index of multigraphs (Q1301715) (← links)
- Edge coloring nearly bipartite graphs (Q1306362) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Chromatic index determined by fractional chromatic index (Q1748268) (← links)
- Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
- A unified approach to distance-two colouring of graphs on surfaces (Q2439826) (← links)
- An upper bound for the chromatic number of line graphs (Q2461774) (← links)
- Edge coloring multigraphs without small dense subsets (Q2515595) (← links)
- A characterization of graphs with fractional total chromatic number equal to \(\Delta +2\) (Q2840543) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- Asymptotics of the chromatic number for quasi-line graphs (Q3503489) (← links)
- (Q4405927) (← links)
- Asymptotics of the list-chromatic index for multigraphs (Q4511485) (← links)
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design (Q5085119) (← links)
- A Combined Logarithmic Bound on the Chromatic Index of Multigraphs (Q5325936) (← links)
- (Q5461439) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
