New bounds for locally irregular chromatic index of bipartite and subcubic graphs

DOI10.1007/s10878-018-0313-7zbMath1410.05072arXiv1611.02341OpenAlexW3103173935WikidataQ129713008 ScholiaQ129713008MaRDI QIDQ1631691

Jakub Przybyło, Roman Soták, Borut Lužar

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.02341

zbMATH Keywords

bipartite graphsubcubic graphlocally irregular graphlocally irregular edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (12)

A Note on the Locally Irregular Edge Colorings of Cacti ⋮ A note on the weak \((2,2)\)-conjecture ⋮ Decomposing degenerate graphs into locally irregular subgraphs ⋮ On the standard \((2,2)\)-conjecture ⋮ Locally irregular edge-coloring of subcubic graphs ⋮ Local irregularity conjecture for 2-multigraphs versus cacti ⋮ On decomposing multigraphs into locally irregular submultigraphs ⋮ Local irregularity conjecture vs. cacti ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ Decomposing split graphs into locally irregular graphs ⋮ Decomposing split graphs into locally irregular graphs ⋮ Graph classes with locally irregular chromatic index at most 4

Cites Work

• 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-parity edge-colorings
• 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 partitions

This page was built for publication: New bounds for locally irregular chromatic index of bipartite and subcubic graphs