Highly Irregular
From MaRDI portal
Publication:5506772
DOI10.1007/978-3-319-31940-7_1zbMath1352.05055OpenAlexW4231436544MaRDI QIDQ5506772
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
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow generalizations of Ramsey theory: A survey
- Hamilton connected graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Panconnected graphs. II
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- Edge weights and vertex colours
- Rainbow connections of graphs: a survey
- Are these the most beautiful?
- How to Define an Irregular Graph
- On Complementary Graphs
- Note on Hamilton Circuits
- Rainbow connection in graphs
- Highly irregular graphs
- Irregular Assignments of Trees and Forests
- Color-Induced Graph Colorings
- Rainbow decompositions
- No Graph is Perfect