On the strong chromatic index of cyclic multigraphs
From MaRDI portal
Publication:1962032
DOI10.1016/S0166-218X(99)00123-7zbMath0957.05038MaRDI QIDQ1962032
Zdzisław Skupień, Peter Horák, Mariusz Meszka, Pavol Gvozdjak
Publication date: 30 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Cites Work
- Induced matchings in bipartite graphs
- Problems and results in combinatorial analysis and graph theory
- The strong chromatic index of a cubic graph is at most 10
- Induced matchings in cubic graphs
- Some maximum multigraphs and adge/vertex distance colourings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item