Pages that link to "Item:Q4052158"
From MaRDI portal
The following pages link to The number of edges in critical graphs. (Q4052158):
Displaying 15 items.
- On the edge-density of 4-critical graphs (Q624211) (← links)
- Coloring vertices and faces of maps on surfaces (Q708418) (← links)
- Two definitions of a determinant and proof of the Szegoe-Kac theorem (Q787225) (← links)
- Common space of spin and spacetime (Q816163) (← links)
- The wave function collapse as an effect of field quantization (Q846158) (← links)
- On list critical graphs (Q1044925) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- Size, chromatic number, and connectivity (Q1340118) (← 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)
- Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs (Q2032704) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
