Pages that link to "Item:Q4053703"
From MaRDI portal
The following pages link to ON THE TWO-COLOURING OF HYPERGRAPHS (Q4053703):
Displaying 39 items.
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem (Q602719) (← links)
- Equilibria of graphical games with symmetries (Q627165) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- A short proof of Fisher's inequality (Q686507) (← links)
- Signsolvability revisited (Q795898) (← links)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- Total domination of graphs and small transversals of hypergraphs (Q949753) (← links)
- Sign-nonsingular matrices and even cycles in directed graphs (Q1073811) (← links)
- Even cycles in directed graphs (Q1084409) (← links)
- Characterization of even directed graphs (Q1085177) (← links)
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560) (← links)
- Square critically 3-chromatic hypergraphs (Q1292808) (← links)
- Hypergraph colouring and the Lovász local lemma (Q1356486) (← links)
- Blocking set free configurations and their relations to digraphs and hypergraphs (Q1356757) (← links)
- On the frequency of the most frequently occurring variable in dual monotone DNFs (Q1357747) (← links)
- Color-critical graphs and hypergraphs with few edges and no short cycles (Q1379816) (← links)
- Antisymmetric flows and edge-connectivity (Q1422419) (← links)
- Strong orientations without even directed circuits (Q1584319) (← links)
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs (Q1637144) (← links)
- Out-degree reducing partitions of digraphs (Q1704574) (← links)
- Monotone bargaining is Nash-solvable (Q1801037) (← links)
- On 2-coloring certain \(k\)-uniform hypergraphs (Q1865419) (← links)
- Some properties of non-bicolorable hypergraphs and the four-color problem (Q1917261) (← links)
- On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs (Q2213812) (← links)
- Majority choosability of digraphs (Q2409821) (← links)
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs (Q2509706) (← links)
- Majority colourings of digraphs (Q2628255) (← links)
- On 2-Colorings of Hypergraphs (Q2947946) (← links)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- The Even Cycle Problem for Directed Graphs (Q3993798) (← links)
- A quantitative Lovász criterion for Property B (Q4993116) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- On hypergraph coloring and 3-uniform linear hypergraph set-indexers of a graph (Q5261049) (← links)
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6545237) (← links)
- Majority coloring of infinite digraphs (Q6621148) (← links)
