Fractional strong chromatic index of bipartite graphs

DOI10.1016/j.disc.2017.02.006zbMath1361.05045OpenAlexW2603093731MaRDI QIDQ526231

Michał Dębski

Publication date: 10 May 2017

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

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

zbMATH Keywords

bipartite graphfractional coloringstrong chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Recent progress on strong edge-coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique number of the square of a line graph
• A stronger bound for the strong chromatic index (extended abstract)
• A superlocal version of Reed's conjecture
• Induced matchings in bipartite graphs
• The strong chromatic index of a cubic graph is at most 10
• Incidence and strong edge colorings of graphs
• A bound on the strong chromatic index of a graph
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• The strong chromatic index ofC4-free graphs
• Induced matchings in cubic graphs
• Nearly complete graphs decomposable into large induced matchings and their applications
• Graph colouring and the probabilistic method

This page was built for publication: Fractional strong chromatic index of bipartite graphs