The following pages link to (Q3853641):
Displaying 50 items.
- On purely tree-colorable planar graphs (Q280945) (← links)
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- A note on the size of edge-chromatic 4-critical graphs (Q294519) (← links)
- The tournament scheduling problem with absences (Q323410) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210) (← links)
- Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973) (← links)
- Edge colorings of planar graphs without 5-cycles with two chords (Q391789) (← links)
- Some criteria for a graph to be class 1 (Q442377) (← links)
- Unique Fulkerson coloring of Petersen minor-free cubic graphs (Q458594) (← links)
- The tree number of a graph with a given girth (Q580352) (← links)
- On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index (Q580363) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- On the equivalence covering number of splitgraphs (Q673014) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- The complexity of list edge-partitions for simple graphs (Q730267) (← links)
- The chromatic index of a graph whose core is a cycle of order at most 13 (Q742593) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small (Q752723) (← links)
- Chromatic index critical graphs of order 9 (Q787152) (← links)
- Regular graphs and edge chromatic number (Q790826) (← links)
- On the intricacy of combinatorial construction problems (Q799678) (← links)
- Hajós' conjecture for line graphs (Q858687) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- An analogy between edge colourings and differentiable manifolds, with a new perspective on 3-critical graphs (Q897294) (← links)
- Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
- Blocking versus nonblocking interprocess communication: A note on the effect on concurrency (Q917284) (← links)
- The maximum edge-disjoint paths problem in complete graphs (Q930909) (← links)
- An adjacency Lemma for critical multigraphs (Q942112) (← links)
- Combinatorics in glass (Q967961) (← links)
- Frustration and overblocking on graphs (Q967970) (← links)
- On the size of critical graphs with maximum degree 8 (Q982631) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← links)
- Forwarding and optical indices of a graph (Q1003676) (← links)
- Color-character of uncolorable cubic graphs (Q1036808) (← links)
- New results on chromatic index critical graphs (Q1043537) (← links)
- A theorem in edge colouring (Q1043601) (← links)
- Complete graphs without polychromatic circuits (Q1050348) (← links)
- The 1-factorization of some line-graphs (Q1056762) (← links)
- Lins-Mandel crystallizations (Q1067259) (← links)
- A \(\Delta\)-subgraph condition for a graph to be class 1 (Q1087551) (← links)
- The edge-chromatic class of regular graphs of degree 4 and their complements (Q1087882) (← links)
- Critical star multigraphs (Q1089350) (← links)
- Recent progress on edge-colouring graphs (Q1090683) (← links)
- Reverse class critical multigraphs (Q1101459) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- Edge-colouring random graphs (Q1109790) (← links)
- Some models of graphs for scheduling sports competitions (Q1110456) (← links)
