Fractional strong chromatic index of bipartite graphs
From MaRDI portal
Publication:526231
DOI10.1016/J.DISC.2017.02.006zbMATH Open1361.05045OpenAlexW2603093731MaRDI QIDQ526231FDOQ526231
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
Cites Work
- Incidence and strong edge colorings of graphs
- A bound on the strong chromatic index of a graph
- Clique number of the square of a line graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph colouring and the probabilistic method
- Induced matchings in bipartite graphs
- The strong chromatic index of a cubic graph is at most 10
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- Title not available (Why is that?)
- Induced matchings in cubic graphs
- A stronger bound for the strong chromatic index (extended abstract)
- The strong chromatic index ofC4-free graphs
- Nearly complete graphs decomposable into large induced matchings and their applications
- A superlocal version of Reed's conjecture
Cited In (2)
Recommendations
- A note on the strong chromatic index of bipartite graphs π π
- On the fractionalf-chromatic index of a graph π π
- On the fractional chromatic index of a graph and its complement π π
- Title not available (Why is that?) π π
- Fractional \(f\)-edge cover chromatic index of graphs π π
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite 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 π π
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)
