Highly irregular
From MaRDI portal
Publication:5506772
Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4139798 (Why is no real title available?)
- scientific article; zbMATH DE number 4043890 (Why is no real title available?)
- scientific article; zbMATH DE number 4047777 (Why is no real title available?)
- scientific article; zbMATH DE number 4095506 (Why is no real title available?)
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- Are these the most beautiful?
- Color-induced graph colorings
- Edge weights and vertex colours
- Hamilton connected graphs
- Highly irregular graphs
- How to Define an Irregular Graph
- Irregular Assignments of Trees and Forests
- No Graph is Perfect
- Note on Hamilton Circuits
- On Complementary Graphs
- Panconnected graphs. II
- Rainbow connection in graphs
- Rainbow decompositions
- Rainbow generalizations of Ramsey theory: A survey
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
This page was built for publication: Highly irregular
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506772)