The following pages link to (Q3853641):
Displaying 50 items.
- Average degrees of edge-chromatic critical graphs (Q1999729) (← links)
- On total and edge coloring some Kneser graphs (Q2168715) (← links)
- Chromatic index of dense quasirandom graphs (Q2171027) (← links)
- Hamiltonicity of edge-chromatic critical graphs (Q2182200) (← links)
- On the average degree of edge chromatic critical graphs (Q2222052) (← links)
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable (Q2230029) (← links)
- Polynomial time complexity of edge colouring graphs with bounded colour classes (Q2249736) (← links)
- On the fg-coloring of graphs (Q2277478) (← links)
- Decompositions of triangle-free 5-regular graphs into paths of length five (Q2352046) (← links)
- The chromatic index of a claw-free graph whose core has maximum degree 2 (Q2354597) (← links)
- On the equitable edge-coloring of 1-planar graphs and planar graphs (Q2409529) (← links)
- On the size of edge chromatic 5-critical graphs (Q2409770) (← links)
- The list-chromatic index of \(K_6\) (Q2436826) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- Double graphs (Q2468004) (← links)
- The average degree of an edge-chromatic critical graph (Q2470447) (← links)
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1 (Q2497482) (← links)
- Berge-Fulkerson conjecture on certain snarks (Q2516508) (← links)
- Chromatic-index-critical graphs of orders 13 and 14 (Q2570100) (← links)
- Overfullness of critical class 2 graphs with a small core degree (Q2673482) (← links)
- On equitable coloring of central graphs and total graphs (Q2839223) (← links)
- On the size of critical graphs with small maximum degree (Q2931953) (← links)
- Minimal edge colorings of class 2 graphs and double graphs (Q2988792) (← links)
- Edge Coloring of Split Graphs (Q3503526) (← links)
- The size of edge chromatic critical graphs with maximum degree 6 (Q3605165) (← links)
- Efficient Vertex- and Edge-Coloring of Outerplanar Graphs (Q3705474) (← links)
- (Q3734425) (← links)
- A generalization of edge-coloring in graphs (Q3735724) (← links)
- A construction of chromatic index critical graphs (Q3931417) (← links)
- Some upper bounds on the total and list chromatic numbers of multigraphs (Q4020707) (← links)
- The edge chromatic number of a directed/mixed multigraph (Q4261182) (← links)
- Hamilton weights and Petersen minors (Q4539867) (← links)
- Cores of class II graphs (Q4857438) (← links)
- A Möbius-type gluing technique for obtaining edge-critical graphs (Q4993955) (← links)
- Some bound of the edge chromatic surplus of certain cubic graphs (Q5009991) (← links)
- A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← links)
- On edge-colouring indifference graphs (Q5096339) (← links)
- (Q5206906) (← links)
- A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture (Q5325954) (← links)
- Distributed link scheduling in wireless networks (Q5858167) (← links)
- A brief history of edge-colorings – with personal reminiscences (Q5862696) (← links)
- The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree (Q5866456) (← links)
- Data transfers in networks with transceivers (Q5903768) (← links)
- Data transfers in networks with transceivers (Q5903907) (← links)
- Edge and total coloring of interval graphs (Q5954080) (← links)
- A tutorial on graph models for scheduling round‐robin sports tournaments (Q6056890) (← links)
- The average degree of edge chromatic critical graphs with maximum degree seven (Q6074595) (← links)
- Simple reduction of f-colorings to edge-colorings (Q6085710) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
- Totally odd immersions in line graphs (Q6117353) (← links)
