Standard

A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs. / Kitaev, Sergey; Pyatkin, Artem V.

In: Discussiones Mathematicae - Graph Theory, Vol. 45, No. 4, 5, 20.01.2025, p. 1157-1162.

Research output: Contribution to journal › Article › peer-review

Harvard

Kitaev, S & Pyatkin, AV 2025, 'A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs', Discussiones Mathematicae - Graph Theory, vol. 45, no. 4, 5, pp. 1157-1162. https://doi.org/10.7151/dmgt.2575

APA

Kitaev, S., & Pyatkin, A. V. (2025). A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs. Discussiones Mathematicae - Graph Theory, 45(4), 1157-1162. [5]. https://doi.org/10.7151/dmgt.2575

Vancouver

Kitaev S, Pyatkin AV. A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs. Discussiones Mathematicae - Graph Theory. 2025 Jan 20;45(4):1157-1162. 5. doi: 10.7151/dmgt.2575

Author

Kitaev, Sergey ; Pyatkin, Artem V. / A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs. In: Discussiones Mathematicae - Graph Theory. 2025 ; Vol. 45, No. 4. pp. 1157-1162.

BibTeX

@article{6bd4b72f4aff4f049624bc367db83e6a,
title = "A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs",
abstract = "An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes several important graph classes. The Mycielski graph of an undirected graph is a larger graph constructed in a specific manner, which maintains the property of being triangle-free but increases the chromatic number. In this note, we prove Hameed's conjecture, which states that the Mycielski graph of a graph G is semi-transitive if and only if G is a bipartite graph. Notably, our solution to the conjecture provides an alternative and shorter proof of the Hameed's result on a complete characterization of semi-transitive extended Mycielski graphs.",
keywords = "semi-transitive graph, semi-transitive orientation, Mycielski graph, extended Mycielski graph",
author = "Sergey Kitaev and Pyatkin, {Artem V.}",
note = "Kitaev, S. A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs / S. Kitaev, A. V. Pyatkin // Discussiones Mathematicae - Graph Theory. – 2025. – DOI 10.7151/dmgt.2575. – EDN RTJLCF. The authors are grateful to the referees for their valuable suggestions, which improved the presentation of the paper. The second author{\textquoteright}s work was supported by the research project of the Sobolev Institute of Mathematics (project FWNF2022-0019).",
year = "2025",
month = jan,
day = "20",
doi = "10.7151/dmgt.2575",
language = "English",
volume = "45",
pages = "1157--1162",
journal = "Discussiones Mathematicae - Graph Theory",
issn = "1234-3099",
publisher = "University of Zielona Gora",
number = "4",

}

RIS

TY - JOUR

T1 - A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs

AU - Kitaev, Sergey

AU - Pyatkin, Artem V.

N1 - Kitaev, S. A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs / S. Kitaev, A. V. Pyatkin // Discussiones Mathematicae - Graph Theory. – 2025. – DOI 10.7151/dmgt.2575. – EDN RTJLCF. The authors are grateful to the referees for their valuable suggestions, which improved the presentation of the paper. The second author’s work was supported by the research project of the Sobolev Institute of Mathematics (project FWNF2022-0019).

PY - 2025/1/20

Y1 - 2025/1/20

N2 - An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes several important graph classes. The Mycielski graph of an undirected graph is a larger graph constructed in a specific manner, which maintains the property of being triangle-free but increases the chromatic number. In this note, we prove Hameed's conjecture, which states that the Mycielski graph of a graph G is semi-transitive if and only if G is a bipartite graph. Notably, our solution to the conjecture provides an alternative and shorter proof of the Hameed's result on a complete characterization of semi-transitive extended Mycielski graphs.

AB - An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes several important graph classes. The Mycielski graph of an undirected graph is a larger graph constructed in a specific manner, which maintains the property of being triangle-free but increases the chromatic number. In this note, we prove Hameed's conjecture, which states that the Mycielski graph of a graph G is semi-transitive if and only if G is a bipartite graph. Notably, our solution to the conjecture provides an alternative and shorter proof of the Hameed's result on a complete characterization of semi-transitive extended Mycielski graphs.

KW - semi-transitive graph

KW - semi-transitive orientation

KW - Mycielski graph

KW - extended Mycielski graph

UR - https://www.scopus.com/pages/publications/105038345742

UR - https://www.elibrary.ru/item.asp?id=81759176

UR - https://www.mendeley.com/catalogue/db9b653d-ccf5-339b-9766-6e5b4c87893d/

U2 - 10.7151/dmgt.2575

DO - 10.7151/dmgt.2575

M3 - Article

VL - 45

SP - 1157

EP - 1162

JO - Discussiones Mathematicae - Graph Theory

JF - Discussiones Mathematicae - Graph Theory

SN - 1234-3099

IS - 4

M1 - 5

ER -

ID: 77548596