Properly edge-coloured subgraphs in colourings of bounded degree
From MaRDI portal
Publication:659683
DOI10.1007/S00373-010-0970-5zbMATH Open1244.05093OpenAlexW2000290050MaRDI QIDQ659683FDOQ659683
Authors: Peter Wagner, Klas Markström, Andrew Thomason 
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0970-5
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
- Title not available (Why is that?)
- What we know and what we do not know about Turán numbers
- Transitiv orientierbare Graphen
- A Combinatorial Theorem
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Edge colorings of complete graphs without tricolored triangles
- Constrained Ramsey numbers of graphs
- Ramsey numbers for local colorings
- On Erdős-Rado numbers
- Complete graphs with no rainbow path
- Title not available (Why is that?)
- An Upper Bound for Constrained Ramsey 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)
