Pages that link to "Item:Q1144050"
From MaRDI portal
The following pages link to On chain and antichain families of a partially ordered set (Q1144050):
Displaying 43 items.
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
- Graph coloring with rejection (Q632809) (← links)
- On Greene-Kleitman's theorem for general digraphs (Q687099) (← links)
- On the size of maximal chains and the number of pairwise disjoint maximal antichains (Q710588) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- ``Poly-unsaturated'' posets: The Greene-Kleitman theorem is best possible (Q1069961) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs (Q1082350) (← links)
- Scheduling jobs with fixed start and end times (Q1098765) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- k-optimal partitions of a directed graph (Q1172068) (← links)
- Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488) (← links)
- Stability number and chromatic number of tolerance graphs (Q1186162) (← links)
- Coflow polyhedra (Q1197009) (← links)
- Greene-Kleitman's theorem for infinite posets (Q1207720) (← links)
- Families of chains of a poset and Sperner properties (Q1356768) (← links)
- Note on scheduling intervals on-line (Q1805461) (← links)
- Approximating minimum cocolorings. (Q1853153) (← links)
- Single step searching in weighted block graphs (Q1894239) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- The bounds for the number of linear extensions via chain and antichain coverings (Q2035097) (← links)
- 4-connected triangulations on few lines (Q2206872) (← links)
- An efficiently solvable graph partition problem to which many problems are reducible (Q2365814) (← links)
- Note on maximal split-stable subgraphs (Q2381823) (← links)
- Berge's conjecture on directed path partitions -- a survey (Q2433711) (← links)
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Proof of Berge's strong path partition conjecture for \(k=2\) (Q2462329) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- (Q2861543) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Covering Graphs by Colored Stable Sets (Q3439145) (← links)
- On Path Partitions and Colourings in Digraphs (Q3655147) (← links)
- Approximation results for the optimum cost chromatic partition problem (Q4572001) (← links)
- A unified approach to known and unknown cases of Berge's conjecture (Q4650184) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Finite posets and Ferrers shapes (Q5937633) (← links)
- Research problems (Q5970608) (← links)
