The following pages link to Marek Kubale (Q237429):
Displaying 50 items.
- On the independence number of some strong products of cycle-powers (Q275570) (← links)
- Edge-chromatic sum of trees and bounded cyclicity graphs (Q294800) (← links)
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- (Q686499) (redirect page) (← links)
- An upper bound for total colouring of graphs (Q686500) (← links)
- Compact scheduling of zero-one time operations in multi-stage systems (Q705502) (← links)
- Optimal procedures and complexity analyses of nonserial converging branch networks (Q918445) (← links)
- (Q967428) (redirect page) (← links)
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (Q967430) (← links)
- The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- Effective on-line coloring of \(P_ 5\)-free graphs (Q1180418) (← links)
- Polynomial graph-colorings (Q1183345) (← links)
- A note on restricted \(H\)-colouring (Q1183461) (← links)
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs (Q1183585) (← links)
- The smallest hard-to-color graph (Q1185079) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- Scheduling multiprocessor tasks on three dedicated processors (Q1197982) (← links)
- On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) (← links)
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
- On the deficiency of bipartite graphs (Q1293200) (← links)
- Sequential colorings and perfect graphs (Q1293205) (← links)
- Interval edge coloring of a graph with forbidden colors (Q1309462) (← links)
- Total colouring regular bipartite graphs is NP-hard (Q1313834) (← links)
- The total chromatic number of regular graphs whose complement is bipartite (Q1318798) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Classes of chromatically equivalent graphs and polygon trees (Q1336708) (← links)
- Semi-strong chromatic number of a graph (Q1346444) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- The chromatic numbers of distance graphs (Q1356742) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- Choice number of 3-colorable elementary graphs (Q1356789) (← links)
- Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
- Rado numbers for \(a(x+y)bz\) (Q1374200) (← links)
- A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees (Q1578404) (← links)
- On (\(P_{5}\), diamond)-free graphs (Q1613431) (← links)
- A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs (Q1613521) (← links)
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
- Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101) (← links)
- Chromatic scheduling in a cyclic open shop (Q1767677) (← links)
- A note on the three color problem (Q1805376) (← links)
- Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
- Interval vertex-coloring of a graph with forbidden colors (Q1823960) (← links)
- Sum coloring of bipartite graphs with bounded degree (Q1884769) (← links)
- Recognizing bull-free perfect graphs (Q1895822) (← links)
- On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\) (Q1901034) (← links)
- A linear time algorithm for edge coloring of binomial trees (Q1916114) (← links)
- Total chromatic number of regular graphs of odd order and high degree (Q1918537) (← links)
