发布求助

文献互助智能选刊最新文献

Forbidden pairs for 2-factorable and hamiltonian graphs under the necessary condition

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2025-05-15 DOI:10.1016/j.dam.2025.05.017

Qiang Wang , Liming Xiong

{"title":"Forbidden pairs for 2-factorable and hamiltonian graphs under the necessary condition","authors":"Qiang Wang , Liming Xiong","doi":"10.1016/j.dam.2025.05.017","DOIUrl":null,"url":null,"abstract":"<div><div>In [1], Wang and Xiong characterize all forbidden pairs (not necessary connected) <math><mrow><mi>R</mi><mo>,</mo><mi>S</mi></mrow></math> such that 2-connected <math><mrow><mo>{</mo><mi>R</mi><mo>,</mo><mi>S</mi><mo>}</mo></mrow></math>-free graph <math><mi>G</mi></math> admitting a 2-factor is hamiltonian. To be more comprehensive, in this paper, we characterize all forbidden pairs (not necessary connected) <math><mrow><mi>R</mi><mo>,</mo><mi>S</mi></mrow></math> such that connected (or 2-edge-connected) <math><mrow><mo>{</mo><mi>R</mi><mo>,</mo><mi>S</mi><mo>}</mo></mrow></math>-free graph <math><mi>G</mi></math> admitting a 2-factor is hamiltonian. Besides, we characterize all forbidden pairs (not necessary connected) <math><mrow><mi>R</mi><mo>,</mo><mi>S</mi></mrow></math> such that connected (or 2-edge-connected) <math><mrow><mo>{</mo><mi>R</mi><mo>,</mo><mi>S</mi><mo>}</mo></mrow></math>-free graph <math><mi>G</mi></math> admitting an even-factor has a 2-factor. Comparing with the main result of Yang and Xiong (2023), we give all disconnected forbidden pairs. In the end, we find all forbidden pairs <math><mrow><mi>R</mi><mo>,</mo><mi>S</mi></mrow></math> such that connected (or 2-edge-connected) <math><mrow><mo>{</mo><mi>R</mi><mo>,</mo><mi>S</mi><mo>}</mo></mrow></math>-free graph <math><mi>G</mi></math> who has an even-factor is hamiltonian.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"373 ","pages":"Pages 290-300"},"PeriodicalIF":1.0000,"publicationDate":"2025-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25002641","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

Abstract

In [1], Wang and Xiong characterize all forbidden pairs (not necessary connected)

R, S

such that 2-connected

{R, S}

-free graph

G

admitting a 2-factor is hamiltonian. To be more comprehensive, in this paper, we characterize all forbidden pairs (not necessary connected)

R, S

such that connected (or 2-edge-connected)

{R, S}

-free graph

G

admitting a 2-factor is hamiltonian. Besides, we characterize all forbidden pairs (not necessary connected)

R, S

such that connected (or 2-edge-connected)

{R, S}

-free graph

G

admitting an even-factor has a 2-factor. Comparing with the main result of Yang and Xiong (2023), we give all disconnected forbidden pairs. In the end, we find all forbidden pairs

R, S

such that connected (or 2-edge-connected)

{R, S}

-free graph

G

who has an even-factor is hamiltonian.

查看原文本刊更多论文

二因子图和哈密顿图在必要条件下的禁止对

在[1]中，Wang和Xiong刻画了所有禁止对（非必要连通）R，S，使得含2因子的2连通{R，S}自由图G是哈密顿的。更全面地说，本文刻画了所有禁止对（不一定连通的）R，S，使得连通（或2边连通）{R，S}自由图G承认一个2因子是哈密顿的。此外，我们刻画了所有禁止对（非必要连通）R，S，使得连通（或2边连通）{R，S}自由图G承认偶因子具有2因子。与Yang and Xiong（2023）的主要结果相比，我们给出了所有断开的禁止对。最后，我们找到了所有的禁止对R，S，使得有偶数因子的连通（或2边连通）{R，S}自由图G是哈密顿的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.