Pages that link to "Item:Q630193"

The following pages link to Approximating the chromatic index of multigraphs (Q630193):

Displaying 23 items.

• On the chromatic index of multigraphs without large triangles (Q794661) (← links)
• The chromatic index of multigraphs that are nearly full (Q910411) (← links)
• Achieving maximum chromatic index in multigraphs (Q1025461) (← links)
• On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
• Asymptotics of the chromatic index for multigraphs (Q1125951) (← links)
• A sublinear bound on the chromatic index of multigraphs (Q1301715) (← links)
• Graph edge coloring: a survey (Q1733850) (← links)
• Chromatic index determined by fractional chromatic index (Q1748268) (← links)
• The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) (Q1926022) (← links)
• Vizing's and Shannon's theorems for defective edge colouring (Q2094863) (← links)
• On the total proper connection of graphs (Q2272614) (← links)
• Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
• Structural properties of edge-chromatic critical multigraphs (Q2338635) (← links)
• Edge coloring multigraphs without small dense subsets (Q2515595) (← links)
• On characterizing Vizing's edge colouring bound (Q3113286) (← links)
• A note concerning the chromatic index of multigraphs (Q3795693) (← links)
• On the chromatic index and the cover index of a multigraph (Q4148004) (← links)
• Improved bounds for the chromatic index of graphs and multigraphs (Q4719322) (← links)
• (Q4735206) (← links)
• A Combined Logarithmic Bound on the Chromatic Index of Multigraphs (Q5325936) (← links)
• Chromatic index, treewidth and maximum degree (Q5892299) (← links)
• Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
• Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)