Pages that link to "Item:Q5932753"
From MaRDI portal
The following pages link to On the number of edges in colour-critical graphs and hypergraphs (Q5932753):
Displaying 32 items.
- Decomposable and indecomposable critical hypergraphs (Q286766) (← links)
- Coloring, sparseness and girth (Q312271) (← links)
- Some new bounds on partition critical hypergraphs (Q412276) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- On color critical graphs (Q1059085) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- On the minimal number of edges in color-critical graphs (Q1272188) (← links)
- Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes (Q1356432) (← 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 complete subgraphs of color-critical graphs (Q1897440) (← links)
- On almost \((k-1)\)-degenerate \((k+1)\)-chromatic graphs and hypergraphs (Q1937546) (← links)
- Counting substructures. I: Color critical graphs (Q1959675) (← links)
- On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
- The local cut lemma (Q2357223) (← links)
- On the minimum number of edges in triangle-free 5-critical graphs (Q2403700) (← links)
- Critical graphs without triangles: an optimum density construction (Q2439835) (← links)
- Graphs with large maximum degree containing no edge-critical graphs (Q2674560) (← links)
- On the critical point-arboricity graphs (Q2778282) (← links)
- On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture (Q2905303) (← links)
- (Q3495386) (← links)
- (Q3576672) (← links)
- A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176) (← links)
- Sparse color‐critical graphs and hypergraphs with no short cycles (Q4297822) (← links)
- (Q4713101) (← links)
- (Q4870406) (← links)
- Color critical hypergraphs with many edges (Q5487778) (← links)
- A local epsilon version of Reed's conjecture (Q5919302) (← links)
- On the minimum number of arcs in \(k\)-dicritical oriented graphs (Q6561323) (← links)
- On the minimum number of arcs in 4-dicritical oriented graphs (Q6657587) (← links)
