Properly edge-coloured subgraphs in colourings of bounded degree
From MaRDI portal
(Redirected from Publication:659683)
Recommendations
- scientific article; zbMATH DE number 1222091
- Edge-colored complete graphs with precisely colored subgraphs
- Between proper and strong edge‐colorings of subcubic graphs
- Between Proper and Strong Edge-Colorings of Subcubic Graphs
- scientific article; zbMATH DE number 1506501
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- On strong edge-colouring of subcubic graphs
- Edge-colouring graphs with bounded local degree sums
- Edge-coloured complete graphs: Connectedness of some subgraphs
- On the vertex-distinguishing proper edge-colorings of graphs
Cites work
- scientific article; zbMATH DE number 3732077 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- A Combinatorial Theorem
- An Upper Bound for Constrained Ramsey Numbers
- Complete graphs with no rainbow path
- Constrained Ramsey numbers of graphs
- Edge colorings of complete graphs without tricolored triangles
- On Erdős-Rado numbers
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Ramsey numbers for local colorings
- Transitiv orientierbare Graphen
- What we know and what we do not know about Turán numbers
Cited in
(4)
This page was built for publication: Properly edge-coloured subgraphs in colourings of bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659683)
