Pages that link to "Item:Q5487778"
From MaRDI portal
The following pages link to Color critical hypergraphs with many edges (Q5487778):
Displaying 15 items.
- Some new bounds on partition critical hypergraphs (Q412276) (← links)
- Supersaturation problem for color-critical graphs (Q505915) (← links)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- Color-critical graphs and hypergraphs with few edges and no short cycles (Q1379816) (← links)
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
- Colour-critical graphs with few edges (Q1584424) (← links)
- On color critical graphs with large adaptable chromatic numbers (Q1684934) (← links)
- Edge-coloring critical graphs with high degree (Q1850002) (← links)
- On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
- XSAT and NAE-SAT of linear CNF classes (Q2440094) (← links)
- Partition critical hypergraphs (Q2851519) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- (Q3576672) (← links)
- On the number of edges in colour-critical graphs and hypergraphs (Q5932753) (← links)