Strong Chromatic Index of 2-Degenerate Graphs
From MaRDI portal
Publication:4920654
DOI10.1002/jgt.21646zbMath1264.05047OpenAlexW1871888924MaRDI QIDQ4920654
Narayanan Narayanan, Gerard Jennhwa Chang
Publication date: 21 May 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21646
edge coloringinduced matchingstrong chromatic index2-degenerate graphchordless graphblock line critical graph
Paths and cycles (05C38) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (21)
On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Strong edge-colorings of sparse graphs with large maximum degree ⋮ Strong chromatic index of \(K_4\)-minor free graphs ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ On a conjecture on the balanced decomposition number ⋮ List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs ⋮ Strong edge-coloring of 2-degenerate graphs ⋮ Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring ⋮ The linear 2-arboricity of sparse graphs ⋮ A note on strong edge coloring of sparse graphs ⋮ Strong edge-colorings for \(k\)-degenerate graphs ⋮ Two greedy consequences for maximum induced matchings ⋮ Neighbor sum distinguishing list total coloring of subcubic graphs ⋮ Strong chromatic index of \(k\)-degenerate graphs ⋮ Strong edge-coloring for jellyfish graphs ⋮ Strong cliques in claw-free graphs ⋮ Strong Chromatic Index of Sparse Graphs ⋮ Note on injective edge-coloring of graphs ⋮ Strong chromatic index of \(K_{1, t}\)-free graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ From edge-coloring to strong edge-coloring
Cites Work
- Unnamed Item
- Induced matchings in bipartite graphs
- A note on the strong chromatic index of bipartite graphs
- Incidence and strong edge colorings of graphs
- A bound on the strong chromatic index of a graph
- Further results on strong edge-colourings in outerplanar graphs
- Strong chromatic index of subset graphs
- Θ-graphs of partial cubes and strong edge colorings
- The strong chromatic index ofC4-free graphs
- Minimally 2-connected graphs.
- On Minimal Blocks
This page was built for publication: Strong Chromatic Index of 2-Degenerate Graphs