Pages that link to "Item:Q1420599"

The following pages link to Edge coloring of graphs with small average degrees (Q1420599):

Displaying 20 items.

• A better lower bound on average degree of 4-list-critical graphs (Q311559) (← links)
• Class I graphs of nonnegative characteristic without special cycles (Q377914) (← links)
• An introduction to the discharging method via graph coloring (Q507506) (← links)
• Sizes of critical graphs with small maximum degrees (Q882787) (← links)
• The average degree of a multigraph critical with respect to edge or total choosability (Q966012) (← links)
• On the size of critical graphs with maximum degree 8 (Q982631) (← links)
• Edge coloring of graphs with small maximum degrees (Q1044957) (← links)
• Average degrees of edge-chromatic critical graphs (Q1999729) (← links)
• On the average degree of edge chromatic critical graphs. II. (Q2200934) (← links)
• On the average degree of edge chromatic critical graphs (Q2222052) (← links)
• Edge coloring of graphs embedded in a surface of nonnegative characteristic (Q2401779) (← links)
• A sufficient condition for a planar graph to be class I (Q2456359) (← links)
• The average degree of an edge-chromatic critical graph (Q2470447) (← links)
• A note on class one graphs with maximum degree six (Q2497484) (← links)
• Degrees and degree sequence of<i>k</i>-edge<i>d</i>-critical graphs (Q2895978) (← links)
• (Q3060863) (← links)
• Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles (Q3066941) (← links)
• Erratum: The average degree of an edge‐chromatic critical graph II (Q3299218) (← links)
• The average degree of a subcubic edge‐chromatic critical graph (Q5379841) (← links)
• The average degree of edge chromatic critical graphs with maximum degree seven (Q6074595) (← links)