Pages that link to "Item:Q1232418"

The following pages link to On small graphs critical with respect to edge colourings (Q1232418):

Displaying 24 items.

• Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
• On the size of graphs of class 2 whose cores have maximum degree two (Q367049) (← links)
• Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees (Q396727) (← links)
• On the average degree of critical graphs with maximum degree six (Q409377) (← links)
• Some criteria for a graph to be class 1 (Q442377) (← links)
• Linear algorithms for edge-coloring trees and unicyclic graphs (Q600259) (← links)
• Chromatic index critical graphs of order 9 (Q787152) (← links)
• Sizes of critical graphs with small maximum degrees (Q882787) (← links)
• Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) (Q933675) (← links)
• New results on chromatic index critical graphs (Q1043537) (← links)
• Edge coloring of graphs with small maximum degrees (Q1044957) (← links)
• On graphs critical with respect to edge-colourings (Q1164055) (← links)
• Remarks on the critical graph conjecture (Q1256492) (← links)
• On the size of edge-chromatic critical graphs (Q1334940) (← links)
• Edge coloring of graphs with small average degrees (Q1420599) (← links)
• There are no edge-chromatic 4-critical graphs of order 12 (Q1894759) (← links)
• Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) (Q2409528) (← links)
• A note on class one graphs with maximum degree six (Q2497484) (← links)
• Finding \(\Delta(\Sigma)\) for a surface \(\Sigma\) of characteristic \(-4\) (Q2833122) (← links)
• Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5 (Q3174244) (← links)
• The size of edge chromatic critical graphs with maximum degree 6 (Q3605165) (← links)
• A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture (Q5325954) (← links)
• A brief history of edge-colorings – with personal reminiscences (Q5862696) (← links)
• Clique-perfectness of complements of line graphs (Q5919747) (← links)