Two-colouring all two-element maximal antichains
From MaRDI portal
Publication:1176381
DOI10.1016/0097-3165(91)90009-6zbMath0742.06004OpenAlexW2022194745MaRDI QIDQ1176381
Dwight Duffus, Robert E. Woodrow, Bill Sands, Norbert W. Sauer
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(91)90009-6
Related Items
Tight bounds on the clique chromatic number, Clique-coloring of \(K_{3,3}\)-minor free graphs, Structural parameterizations of clique coloring, Fibres of width 3 ordered sets, Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3, 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, Complexity-separating graph classes for vertex, edge and total colouring, Covering partial cubes with zones, The jump of the clique chromatic number of random graphs, Perfect graphs of arbitrarily large clique-chromatic number, A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals, Random perfect graphs, Fibres and ordered set coloring, Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\), Clique coloring \(B_1\)-EPG graphs, A smallest-fibre-size to poset-size ratio approaching \({8 \over 15}\), A note on maximal antichains in ordered sets, Complexity of clique coloring and related problems, When will every maximal \(F\)-free subposet contain a maximal element?, Unnamed Item, Graphs with large clique-chromatic numbers, Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable, Colouring clique-hypergraphs of circulant graphs, Products of chains with monochromatic maximal chains and antichains, Colouring clique-hypergraphs of circulant graphs, Complexity of clique-coloring odd-hole-free graphs, Packing and covering k-chain free subsets in Boolean lattices, 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
