The following pages link to Fibres and ordered set coloring (Q1177956):
Displaying 31 items.
- Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- Tight bounds on the clique chromatic number (Q820840) (← links)
- Subgraph transversal of graphs (Q844218) (← links)
- Covering partial cubes with zones (Q888589) (← links)
- Packing and covering k-chain free subsets in Boolean lattices (Q1043999) (← links)
- Two-colouring all two-element maximal antichains (Q1176381) (← links)
- A smallest-fibre-size to poset-size ratio approaching \({8 \over 15}\) (Q1200010) (← links)
- A note on maximal antichains in ordered sets (Q1205155) (← links)
- On ordered sets without 2-colourings (Q1301737) (← links)
- Fibres of width 3 ordered sets (Q1338130) (← links)
- The complexity of the fixed point property (Q1354627) (← links)
- On the clique-transversal number of chordal graphs (Q1584423) (← links)
- Ramsey numbers for partially-ordered sets (Q1789062) (← links)
- Products of chains with monochromatic maximal chains and antichains (Q1815837) (← links)
- On covering all cliques of a chordal graph (Q1910588) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- When will every maximal \(F\)-free subposet contain a maximal element? (Q2270171) (← links)
- A linear-time algorithm for clique-coloring planar graphs (Q2294308) (← links)
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
- Clique-coloring claw-free graphs (Q2631088) (← links)
- Graphs with large clique-chromatic numbers (Q2788733) (← links)
- More Results on Clique-chromatic Numbers of Graphs with No Long Path (Q2945676) (← links)
- Subgraph-avoiding coloring of graphs (Q3553235) (← links)
- Complexity of clique-coloring odd-hole-free graphs (Q3652547) (← links)
- (Q5708496) (← links)
