Pages that link to "Item:Q3928241"
From MaRDI portal
The following pages link to The NP-Completeness of Edge-Coloring (Q3928241):
Displaying 50 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- A note on optical routing on trees (Q287098) (← links)
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- On a limit of the method of Tashkinov trees for edge-colouring (Q297916) (← links)
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- The tournament scheduling problem with absences (Q323410) (← links)
- A faster test for 4-flow-criticality in snarks (Q324779) (← links)
- On the chromatic index of cographs and join graphs (Q324879) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- On excessive index of certain networks (Q391312) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Edge-chromatic numbers of Mycielski graphs (Q409467) (← links)
- Minimum decomposition into convex binary matrices (Q423930) (← links)
- Some criteria for a graph to be class 1 (Q442377) (← links)
- Relating edge-coverings to the classification of \(\mathbb Z^k_2\)-magic graphs (Q449139) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- The complexity of the zero-sum 3-flows (Q477676) (← links)
- Excessive index for mesh derived networks (Q491612) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Successive partition of edges of bipartite graph into matchings (Q502001) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Two easy duality theorems for product partial orders (Q580378) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Excessive factorizations of bipartite multigraphs (Q602754) (← links)
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Local algorithms for edge colorings in UDGs (Q638541) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- On upper bounds for parameters related to the construction of special maximum matchings (Q658043) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- On the equivalence covering number of splitgraphs (Q673014) (← links)
- Stable sets versus independent sets (Q686148) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- Compact scheduling of zero-one time operations in multi-stage systems (Q705502) (← links)
- Edge-coloring of 3-uniform hypergraphs (Q729801) (← 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)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small (Q752723) (← links)
- On linear k-arboricity (Q761470) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
