Fibres and ordered set coloring
From MaRDI portal
Publication:1177956
DOI10.1016/0097-3165(91)90083-SzbMath0757.06001MaRDI QIDQ1177956
William T. jun. Trotter, Dwight Duffus, Henry A. Kierstead
Publication date: 26 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)
Related Items (31)
Tight bounds on the clique chromatic number ⋮ Fibres of width 3 ordered sets ⋮ Clique-coloring claw-free graphs ⋮ Subgraph transversal of graphs ⋮ The complexity of the fixed point property ⋮ On covering all cliques of a chordal graph ⋮ More Results on Clique-chromatic Numbers of Graphs with No Long Path ⋮ Covering partial cubes with zones ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ Two-colouring all two-element maximal antichains ⋮ Algorithmic aspects of clique-transversal and clique-independent sets ⋮ Clique colourings of geometric graphs ⋮ Subgraph-avoiding coloring of graphs ⋮ Clique coloring \(B_1\)-EPG graphs ⋮ A linear-time algorithm for clique-coloring problem in circular-arc graphs ⋮ A smallest-fibre-size to poset-size ratio approaching \({8 \over 15}\) ⋮ A note on maximal antichains in ordered sets ⋮ When will every maximal \(F\)-free subposet contain a maximal element? ⋮ Algorithms for clique-independent sets on subclasses of circular-arc graphs ⋮ Graphs with large clique-chromatic numbers ⋮ Ramsey numbers for partially-ordered sets ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly ⋮ Products of chains with monochromatic maximal chains and antichains ⋮ Unnamed Item ⋮ Complexity of clique-coloring odd-hole-free graphs ⋮ Packing and covering k-chain free subsets in Boolean lattices ⋮ The clique-perfectness and clique-coloring of outer-planar graphs ⋮ On the clique-transversal number of chordal graphs ⋮ On ordered sets without 2-colourings ⋮ Hitting all maximal independent sets of a bipartite graph
Cites Work
This page was built for publication: Fibres and ordered set coloring
