A note on the weak \((2,2)\)-conjecture

DOI10.1016/J.DISC.2018.10.033zbMath1400.05186OpenAlexW2900608459WikidataQ123351362 ScholiaQ123351362MaRDI QIDQ1625809

Jakub Przybyło

Publication date: 29 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.10.033

zbMATH Keywords

graph decompositionlocally irregular graph\(1\)-\(2\)-\(3\) conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On the standard \((2,2)\)-conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• On decomposing graphs of large minimum degree into locally irregular subgraphs
• Decomposing graphs into a constant number of locally irregular subgraphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On vertex-coloring 13-edge-weighting
• New bounds for locally irregular chromatic index of bipartite and subcubic graphs
• Edge weights and vertex colours
• On the complexity of determining the irregular chromatic index of a graph
• On decomposing regular graphs into locally irregular subgraphs
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• How to Define an Irregular Graph
• A New Upper Bound for the Irregularity Strength of Graphs
• Irregular Assignments of Trees and Forests
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength
• On the Irregularity Strength of Dense Graphs
• Irregularity strength of dense graphs

This page was built for publication: A note on the weak \((2,2)\)-conjecture