Highly irregular
DOI10.1007/978-3-319-31940-7_1zbMATH Open1352.05055OpenAlexW4231436544MaRDI QIDQ5506772FDOQ5506772
Authors: Gary Chartrand
Publication date: 16 December 2016
Published in: Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_1
Recommendations
Trees (05C05) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Edge weights and vertex colours
- Note on Hamilton Circuits
- Rainbow connection in graphs
- Title not available (Why is that?)
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- Irregular Assignments of Trees and Forests
- Rainbow generalizations of Ramsey theory: A survey
- Panconnected graphs. II
- On Complementary Graphs
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- Title not available (Why is that?)
- Hamilton connected graphs
- Highly irregular graphs
- How to Define an Irregular Graph
- Color-induced graph colorings
- Are these the most beautiful?
- No Graph is Perfect
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rainbow decompositions
Cited In (2)
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)