scientific article; zbMATH DE number 4023316
From MaRDI portal
Publication:3765800
Recommendations
Cited in
(19)- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
- scientific article; zbMATH DE number 3885935 (Why is no real title available?)
- On Sets of Acquaintances and Strangers at any Party
- scientific article; zbMATH DE number 3898920 (Why is no real title available?)
- scientific article; zbMATH DE number 3929032 (Why is no real title available?)
- scientific article; zbMATH DE number 3977043 (Why is no real title available?)
- scientific article; zbMATH DE number 3983190 (Why is no real title available?)
- scientific article; zbMATH DE number 4004214 (Why is no real title available?)
- scientific article; zbMATH DE number 4049669 (Why is no real title available?)
- The minimum number of subgraphs in a graph and its complement
- scientific article; zbMATH DE number 1151840 (Why is no real title available?)
- Two-colorings with many monochromatic cliques in both colors
- scientific article; zbMATH DE number 881297 (Why is no real title available?)
- Bounding monochromatic triangles using squares
- The minimum number of vertices of graphs containing two monochromatic triangles for any edge \(2\)-coloring
- Edge disjoint monochromatic triangles in 2-colored graphs
- Variations on Ramsey numbers and minimum numbers of monochromatic triangles in line 2-colorings of configurations
- Ramsey numbers of trails and circuits
- Coloring a graph optimally with two colors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765800)
