Impact
~5k
people reached
- 0 posts edited
- 0 helpful flags
- 22 votes cast
Jan
13 |
answered | Why are planar graphs so exceptional? |
Sep
24 |
revised |
Embedding planar graphs into the grid
added 2 characters in body |
Sep
24 |
answered | Embedding planar graphs into the grid |
Sep
5 |
awarded | Yearling |
Sep
5 |
revised |
Algorithm to determine isomorphism of 2 maximal planar graphs
deleted 40 characters in body |
Sep
5 |
answered | Algorithm to determine isomorphism of 2 maximal planar graphs |
Jun
22 |
awarded | Revival |
Mar
4 |
comment |
the choosing of an independent set in a specific $k$-partite graph
Such an independent set is called an "independent transversal". There is a large literature on this topic, although I have never seen the $\Delta(G)=2$ assumption in this setting. |
Mar
4 |
comment |
a question about Brooks' Theorem for $\Delta =4$
No, it is Brooks' Theorem. |
Mar
4 |
comment |
a question about Brooks' Theorem for $\Delta =4$
Johansson proved that every triangle-free graph with maximum degree $\Delta$ is $O(\Delta/\log\Delta)$-colourable. |
Dec
5 |
awarded | Necromancer |
Oct
2 |
awarded | Yearling |
Oct
2 |
answered | Do there exist sparse graphs with large crossing number? |
Sep
24 |
awarded | Autobiographer |
Jul
8 |
answered | triangles in a graph with specified clique number |
Jul
8 |
answered | An upper bound for number of triangles in a graph |
Mar
27 |
comment |
Genus of the graph $K_{4,2,2,2}$
Here is a paper that seems relevant (based on the title): Said Bettayeb, Quan T. Nguyen, "The genus of the complete multipartite graph and the complete multi-layered graph," aiccsa, pp.1-4, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010, 2010. doi.ieeecomputersociety.org/10.1109/AICCSA.2010.5587024 |
Mar
4 |
awarded | Critic |
Feb
12 |
answered | Big Mono-Chromatic Subgraphs of Vertex 2-Colourings |
Jan
22 |
answered | Finding maximal k-degenerate subgraphs |