Pages that link to "Item:Q1827679"

The following pages link to Measurements of edge-uncolorability (Q1827679):

Displaying 26 items.

• On snarks that are far from being 3-edge colorable (Q281587) (← links)
• Three measures of edge-uncolorability (Q616368) (← links)
• On resistance of graphs (Q643030) (← links)
• Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
• On disjoint matchings in cubic graphs (Q968438) (← links)
• Color-character of uncolorable cubic graphs (Q1036808) (← links)
• Oddness to resistance ratios in cubic graphs (Q1625797) (← links)
• On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
• Gallai's question and constructions of almost hypotraceable graphs (Q1752468) (← links)
• Weak oddness as an approximation of oddness and resistance in cubic graphs (Q1752608) (← links)
• Snarks with resistance \(n\) and flow resistance \(2n\) (Q2121784) (← links)
• 3-critical subgraphs of snarks (Q2155553) (← links)
• Girth, oddness, and colouring defect of snarks (Q2166293) (← links)
• Coverings of cubic graphs and 3-edge colorability (Q2214325) (← links)
• Small snarks with large oddness (Q2260625) (← links)
• The smallest nontrivial snarks of oddness 4 (Q2306590) (← links)
• Nowhere-zero flows on signed regular graphs (Q2346576) (← links)
• On parsimonious edge-colouring of graphs with maximum degree three (Q2376086) (← links)
• On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (Q2449123) (← links)
• Minimal edge colorings of class 2 graphs and double graphs (Q2988792) (← links)
• Cubic Graphs with Large Circumference Deficit (Q3188672) (← links)
• On Sylvester Colorings of Cubic Graphs (Q4622633) (← links)
• Parsimonious edge-coloring on surfaces (Q5009990) (← links)
• Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
• Snarks with large oddness and small number of vertices (Q5419943) (← links)
• Reducible 3-critical graphs (Q6181220) (← links)