Fractional strong chromatic index of bipartite graphs

DOI10.1016/J.DISC.2017.02.006MaRDI QIDQ526231zbMATH OpenOpenAlexFDO

Authors 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 graphstrong chromatic indexfractional coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A note on the strong chromatic index of bipartite graphs
• On the fractional \(f\)-chromatic index of a graph
• On the fractional chromatic index of a graph and its complement
• scientific article; zbMATH DE number 4187830
• Fractional \(f\)-edge cover chromatic index of graphs
• The strong chromatic index of a class of graphs
• The chromatic index of nearly bipartite multigraphs
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• A bound on the strong chromatic index of a graph

Cites work

• scientific article; zbMATH DE number 4177085 (Why is no real title available?)
• scientific article; zbMATH DE number 4187830 (Why is no real title available?)
• A bound on the strong chromatic index of a graph
• A stronger bound for the strong chromatic index (extended abstract)
• A superlocal version of Reed's conjecture
• Clique number of the square of a line graph
• Graph colouring and the probabilistic method
• Incidence and strong edge colorings of graphs
• Induced matchings in bipartite graphs
• Induced matchings in cubic graphs
• Nearly complete graphs decomposable into large induced matchings and their applications
• On six problems posed by Jarik Nešetřil
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• The strong chromatic index of a cubic graph is at most 10
• The strong chromatic index ofC4-free graphs

Cited in

(5)

• Clique number of the square of a line graph
• Recent progress on strong edge-coloring of graphs
• On a topological relaxation of a conjecture of Erdős and Nešetřil
• A note on the strong chromatic index of bipartite graphs
• The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526231)