Revisiting semistrong edge‐coloring of graphs-Reference-Cited by-同舟云学术

Revisiting semistrong edge‐coloring of graphs

Published:2023-11-22 Issue: Volume: Page:
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:Journal of Graph Theory

Author:

Lužar Borut¹^ORCID,Mockovčiaková Martina²,Soták Roman³^ORCID

Affiliation:

1. Faculty of Information Studies in Novo Mesto Novo Mesto Slovenia

2. University of West Bohemia, Faculty of Applied Sciences Pilsen Czech Republic

3. Pavol Jozef Šafárik University, Faculty of Science Košice Slovakia

Abstract

AbstractA matching in a graph is semistrong if every edge of has an endvertex of degree one in the subgraph induced by the vertices of . A semistrong edge‐coloring of a graph is a proper edge‐coloring in which every color class induces a semistrong matching. In this paper, we continue investigation of properties of semistrong edge‐colorings initiated by Gyárfás and Hubenko. We establish tight upper bounds for general graphs and for graphs with maximum degree 3. We also present bounds about semistrong edge‐coloring which follow from results regarding other, at first sight nonrelated, problems. We conclude the paper with several open problems.

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.23059

Reference17 articles.

1. Degenerate matchings and edge colorings

2. Colouring graphs with sparse neighbourhoods: Bounds and applications

3. A Stronger Bound for the Strong Chromatic Index

4. The minimum forcing number of perfect matchings in the hypercube;Diwan A. A.;Discrete Math,2019

5. Problems and results in combinatorial analysis and graph theory;Erdős P.;Discrete Math,1988