Matthews-Sumner Conjecture and Equivalences
|
|
- Virgil Ford
- 5 years ago
- Views:
Transcription
1 University of Memphis June 21, 2012
2 Forbidden Subgraphs Definition A graph G is H-free if G contains no induced copy of the graph H as a subgraph. More generally, we say G is F-free for some family of connected graphs F, provided G contains no induced subgraph isomorphic to a graph in F.
3 Forbidden Subgraphs Definition A graph G is H-free if G contains no induced copy of the graph H as a subgraph. More generally, we say G is F-free for some family of connected graphs F, provided G contains no induced subgraph isomorphic to a graph in F. Forbidden subgraphs have been studied relative to various Hamiltonian type properties
4 Forbidden Subgraphs Definition A graph G is H-free if G contains no induced copy of the graph H as a subgraph. More generally, we say G is F-free for some family of connected graphs F, provided G contains no induced subgraph isomorphic to a graph in F. Forbidden subgraphs have been studied relative to various Hamiltonian type properties Traceable,
5 Forbidden Subgraphs Definition A graph G is H-free if G contains no induced copy of the graph H as a subgraph. More generally, we say G is F-free for some family of connected graphs F, provided G contains no induced subgraph isomorphic to a graph in F. Forbidden subgraphs have been studied relative to various Hamiltonian type properties Traceable, Hamiltonian,
6 Forbidden Subgraphs Definition A graph G is H-free if G contains no induced copy of the graph H as a subgraph. More generally, we say G is F-free for some family of connected graphs F, provided G contains no induced subgraph isomorphic to a graph in F. Forbidden subgraphs have been studied relative to various Hamiltonian type properties Traceable, Hamiltonian, Hamiltonian Connected,
7 Forbidden Subgraphs Definition A graph G is H-free if G contains no induced copy of the graph H as a subgraph. More generally, we say G is F-free for some family of connected graphs F, provided G contains no induced subgraph isomorphic to a graph in F. Forbidden subgraphs have been studied relative to various Hamiltonian type properties Traceable, Hamiltonian, Hamiltonian Connected, Pancyclic,
8 Forbidden Subgraphs Definition A graph G is H-free if G contains no induced copy of the graph H as a subgraph. More generally, we say G is F-free for some family of connected graphs F, provided G contains no induced subgraph isomorphic to a graph in F. Forbidden subgraphs have been studied relative to various Hamiltonian type properties Traceable, Hamiltonian, Hamiltonian Connected, Pancyclic, Panconnected.
9 The Matthews-Sumner Conjecture, 1984 Conjecture A Every 4-connected claw-free graph is hamiltonian.
10 Thomassen s Conjecture, 1986 Conjecture B Every 4-connected line graph is hamiltonian.
11 Thomassen s Conjecture, 1986 Conjecture B Every 4-connected line graph is hamiltonian. This conjecture was mentioned as early as 1981
12 4-connected is necessary Theorem (Jackson, Wormald) Let G be a 3-connected K 1,r -free graph with n vertices. Then G contains a cycle of length at least n c where c = (log26+2log2(2r 1)) 1.
13 4-connected is necessary Theorem (Jackson, Wormald) Let G be a 3-connected K 1,r -free graph with n vertices. Then G contains a cycle of length at least n c where c = (log26+2log2(2r 1)) 1. There are infinite families of examples obtained by taking the inflations (replacing a vertex by a triangle) of appropriate 3-regular graphs (like the Petersen graph) that imply that the Jackson-Wormald bound is of the correct order of magnitude (but not necessarily with the constant c).
14 EIDMA workshop on Hamiltonicity of 2-tough graphs 1996 Line graphs are claw-free, so the Matthews-Sumner Conjecture implies the Thomassen conjecture.
15 EIDMA workshop on Hamiltonicity of 2-tough graphs 1996 Line graphs are claw-free, so the Matthews-Sumner Conjecture implies the Thomassen conjecture. Herbert Fleischner conjectured that the two conjectures were equivalent.
16 EIDMA workshop on Hamiltonicity of 2-tough graphs 1996 Line graphs are claw-free, so the Matthews-Sumner Conjecture implies the Thomassen conjecture. Herbert Fleischner conjectured that the two conjectures were equivalent. This was verified by Zdenek Ryjáček and the result appeared in 1997.
17 Present Ryjáček Closure Theorem (Ryjáček. 1997) Let G be a claw-free graph. Then
18 Present Ryjáček Closure Theorem (Ryjáček. 1997) Let G be a claw-free graph. Then the closure cl(g) is uniquely determined,
19 Present Ryjáček Closure Theorem (Ryjáček. 1997) Let G be a claw-free graph. Then the closure cl(g) is uniquely determined, the circumference of cl(g) is equal to the circumference of G,
20 Present Ryjáček Closure Theorem (Ryjáček. 1997) Let G be a claw-free graph. Then the closure cl(g) is uniquely determined, the circumference of cl(g) is equal to the circumference of G, cl(g) is hamiltonian if and only if G is hamiltonian,
21 Present Ryjáček Closure Theorem (Ryjáček. 1997) Let G be a claw-free graph. Then the closure cl(g) is uniquely determined, the circumference of cl(g) is equal to the circumference of G, cl(g) is hamiltonian if and only if G is hamiltonian, cl(g) is the line graph of a triangle-free graph.
22 Present Ryjáček Closure Theorem (Ryjáček. 1997) Let G be a claw-free graph. Then the closure cl(g) is uniquely determined, the circumference of cl(g) is equal to the circumference of G, cl(g) is hamiltonian if and only if G is hamiltonian, cl(g) is the line graph of a triangle-free graph. This closure was patterned after the Bondy - Chvátal closure relative to Ore s Theorem.
23 Chvátal s Conjecture, 1973 Toughness Conjecture There is a positive k such that if t(g) > k, then G is Hamiltonian.
24 Chvátal s Conjecture, 1973 Toughness Conjecture There is a positive k such that if t(g) > k, then G is Hamiltonian. The value of k = 3/2 initially proposed.
25 Chvátal s Conjecture, 1973 Toughness Conjecture There is a positive k such that if t(g) > k, then G is Hamiltonian. The value of k = 3/2 initially proposed. For some time the value k = 2 was investigated, which was interesting since t(g) 2 for any 4-connected claw-free graph.
26 Chvátal s Conjecture, 1973 Toughness Conjecture There is a positive k such that if t(g) > k, then G is Hamiltonian. The value of k = 3/2 initially proposed. For some time the value k = 2 was investigated, which was interesting since t(g) 2 for any 4-connected claw-free graph. The Chvátal Conjecture is still open.
27 Present Status Theorem (Zhan, 1991) Every 7-connected line graph is hamiltonian.
28 Present Status Theorem (Zhan, 1991) Every 7-connected line graph is hamiltonian. This was proved independently by Bill Jackson, but not published.
29 Present Status Theorem (Zhan, 1991) Every 7-connected line graph is hamiltonian. This was proved independently by Bill Jackson, but not published. Theorem (Kaiser and Vrana, 2011) Every claw-free, 5-connected graph with minimum degree 6 is hamiltonian connected, and hence hamiltonian.
30 Hamiltonicity in Line Graphs Definition A circuit is a closed walk in a graph that does not repeat edges.
31 Hamiltonicity in Line Graphs Definition A circuit is a closed walk in a graph that does not repeat edges. Definition A dominating circuit is a circuit in which each edge of the graph is either on the circuit, or incident to a vertex on the circuit.
32 Hamiltonicity in Line Graphs Definition A circuit is a closed walk in a graph that does not repeat edges. Definition A dominating circuit is a circuit in which each edge of the graph is either on the circuit, or incident to a vertex on the circuit. Theorem (Harary and Nash-Williams, 1965) Let H be a graph with at least 3 edges. Then L(H) is hamiltonian if and only if H = K 1,r with r 3 or H contains a dominating circuit.
33 Appropriate Edge-Connectivity for 4-connected Line Graph Question What is the counterpart of 4-connectivity in L(H)?
34 Appropriate Edge-Connectivity for 4-connected Line Graph Question What is the counterpart of 4-connectivity in L(H)? Definition A graph H is essentially 4-edge connected if it contains no edge-cut R such that R < 4 and at least two components of H R contain an edge.
35 The Dominating Circuit Conjecture Theorem L(H) is 4-connected if and only if H is essentially 4-edge connected.
36 The Dominating Circuit Conjecture Theorem L(H) is 4-connected if and only if H is essentially 4-edge connected. Conjecture C Every essentially 4-edge connected graph contains a dominating circuit.
37 4-edge Connectivity is a Stronger Condition Note that 4-edge connected graphs contain two edge-disjoint spanning trees.
38 4-edge Connectivity is a Stronger Condition Note that 4-edge connected graphs contain two edge-disjoint spanning trees. Hence, 4-edge connected graphs contain dominating circuits.
39 4-edge Connectivity is a Stronger Condition Note that 4-edge connected graphs contain two edge-disjoint spanning trees. Hence, 4-edge connected graphs contain dominating circuits. Hence, line graphs of 4-edge connected graphs are hamiltonian.
40 Cubic Graphs Definition A graph H is cyclically 4-edge-connected if H contains no edge-cut R such that R < 4 and at least 2 components of H R contain a cycle.
41 Cubic Graphs Definition A graph H is cyclically 4-edge-connected if H contains no edge-cut R such that R < 4 and at least 2 components of H R contain a cycle. Remark A cubic graph is essentially 4-edge-connected if and only if it is cyclically 4-edge-connected.
42 Ash and Jackson Cubic Graph Conjecture Conjecture D Every cyclically 4-edge-connected cubic graph has a dominating cycle.
43 Ash and Jackson Cubic Graph Conjecture Conjecture D Every cyclically 4-edge-connected cubic graph has a dominating cycle. Theorem (Fleischner and B. Jackson 1989) Conjecture D is equivalent to conjectures A,B, and C.
44 Fleischner s Conjecture Conjecture E Every cyclically 4-edge-connected cubic graph that is not 3-edge-colorable has a dominating cycle.
45 Fleischner s Conjecture Conjecture E Every cyclically 4-edge-connected cubic graph that is not 3-edge-colorable has a dominating cycle. Theorem (Kochol 2000) Conjecture E is equivalent to Conjectures A,B,C, and D.
46 Snark Conjecture Definition A snark is a cyclically 4-edge-connected cubic graph of girth at least 5 that is not 3-edge-colorable.
47 Snark Conjecture Definition A snark is a cyclically 4-edge-connected cubic graph of girth at least 5 that is not 3-edge-colorable. Conjecture F Every snark has a dominating cycle.
48 Snark Conjecture Definition A snark is a cyclically 4-edge-connected cubic graph of girth at least 5 that is not 3-edge-colorable. Conjecture F Every snark has a dominating cycle. Theorem (Broersma, Fijavz, Kaiser, Kužel, Ryjáček and Vrana, 2008) Conjectures A F are equivalent.
49 Stronger Appearing Equivalent Conjectures Conjecture G Every 4-connected claw-free graph is hamiltonian connected.
50 Stronger Appearing Equivalent Conjectures Conjecture G Every 4-connected claw-free graph is hamiltonian connected. Conjecture H Every 4-connected line graph is hamiltonian connected.
51 Stronger Appearing Equivalent Conjectures Conjecture G Every 4-connected claw-free graph is hamiltonian connected. Conjecture H Every 4-connected line graph is hamiltonian connected. Theorem (Kužel, Ryjáček, Vána, Xiong)
52 Stronger Appearing Equivalent Conjectures Conjecture G Every 4-connected claw-free graph is hamiltonian connected. Conjecture H Every 4-connected line graph is hamiltonian connected. Theorem (Kužel, Ryjáček, Vána, Xiong) 1 Conjectures G and H are equivalent.
53 Stronger Appearing Equivalent Conjectures Conjecture G Every 4-connected claw-free graph is hamiltonian connected. Conjecture H Every 4-connected line graph is hamiltonian connected. Theorem (Kužel, Ryjáček, Vána, Xiong) 1 Conjectures G and H are equivalent. 2 Conjectures A H are equivalent.
54 1-Hamiltonian-Connected Definition A graph G is 1-Hamilton-connected if for any vertex x of G there is a Hamilton path in G x between any two vertices.
55 1-Hamiltonian-Connected Definition A graph G is 1-Hamilton-connected if for any vertex x of G there is a Hamilton path in G x between any two vertices. Conjecture I Every 4-connected claw-free graph is 1-Hamiltonian Connected.
56 1-Hamiltonian-Connected Definition A graph G is 1-Hamilton-connected if for any vertex x of G there is a Hamilton path in G x between any two vertices. Conjecture I Every 4-connected claw-free graph is 1-Hamiltonian Connected. Theorem (Ryjáček, Saburov, and Vána, 2011) Conjectures A I are equivalent.
57 Survey Paper How Many Conjectures can you Stand? a Survey
58 Survey Paper How Many Conjectures can you Stand? a Survey by Broersma Ryjáček, and P. Vrána
HAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS
HAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS FLORIAN PFENDER Abstract. Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3,,,,, ), i.e. T is a chain
More informationPairs of Forbidden Subgraphs for Pancyclicity
1 / 24 Pairs of Forbidden Subgraphs for Pancyclicity James Carraher University of Nebraska Lincoln s-jcarrah1@math.unl.edu Joint Work with Mike Ferrara, Tim Morris, Mike Santana October 2012 Hamiltonian
More informationHamiltonian claw-free graphs
Hamiltonian claw-free graphs Hong-Jian Lai, Yehong Shao, Ju Zhou and Hehui Wu August 30, 2005 Abstract A graph is claw-free if it does not have an induced subgraph isomorphic to a K 1,3. In this paper,
More informationRESEARCH PROBLEMS FROM THE 18TH WORKSHOP 3IN edited by Mariusz Meszka
Opuscula Mathematica Vol. 30 No. 4 2010 http://dx.doi.org/10.7494/opmath.2010.30.4.527 RESEARCH PROBLEMS FROM THE 18TH WORKSHOP 3IN1 2009 edited by Mariusz Meszka Abstract. A collection of open problems
More informationForbidden Subgraphs for Pancyclicity
1 / 22 Forbidden Subgraphs for Pancyclicity James Carraher University of Nebraska Lincoln s-jcarrah1@math.unl.edu Joint Work with Mike Ferrara, Tim Morris, Mike Santana September 2012 Hamiltonian 2 / 22
More informationHamiltonian properties of 3-connected {claw,hourglass}-free graphs
Hamiltonian properties of 3-connected {claw,hourglass}-free graphs Zdeněk Ryjáček 1,3,5 Petr Vrána 1,3,5 Liming Xiong 2,4,6 November 10, 2017 Abstract We show that some sufficient conditions for hamiltonian
More informationSome Results on Paths and Cycles in Claw-Free Graphs
Some Results on Paths and Cycles in Claw-Free Graphs BING WEI Department of Mathematics University of Mississippi 1 1. Basic Concepts A graph G is called claw-free if it has no induced subgraph isomorphic
More informationWe would like a theorem that says A graph G is hamiltonian if and only if G has property Q, where Q can be checked in polynomial time.
9 Tough Graphs and Hamilton Cycles We would like a theorem that says A graph G is hamiltonian if and only if G has property Q, where Q can be checked in polynomial time. However in the early 1970 s it
More informationToughness and prism-hamiltonicity of P 4 -free graphs
Toughness and prism-hamiltonicity of P 4 -free graphs M. N. Ellingham Pouria Salehi Nowbandegani Songling Shan Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, TN 37240
More informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
More informationThe Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index
The Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 6506, U.S.A. Huiya Yan Department of Mathematics
More informationHamiltonian decomposition of prisms over cubic graphs
Hamiltonian decomposition of prisms over cubic graphs Moshe Rosenfeld, Ziqing Xiang To cite this version: Moshe Rosenfeld, Ziqing Xiang. Hamiltonian decomposition of prisms over cubic graphs. Discrete
More informationLine Graphs and Forbidden Induced Subgraphs
Line Graphs and Forbidden Induced Subgraphs Hong-Jian Lai and Ľubomír Šoltés Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 July 14, 2002 Abstract Beineke and Robertson independently
More informationEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics 308 (2008) 532 536 www.elsevier.com/locate/disc Note Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Hong-Jian Lai a, Yehong Shao b, Mingquan Zhan
More informationarxiv: v2 [math.co] 7 Jan 2016
Global Cycle Properties in Locally Isometric Graphs arxiv:1506.03310v2 [math.co] 7 Jan 2016 Adam Borchert, Skylar Nicol, Ortrud R. Oellermann Department of Mathematics and Statistics University of Winnipeg,
More informationUniversity of Twente. Faculty of Mathematical Sciences. Strengthening the closure concept in claw-free graphs
Faculty of Mathematical Sciences University of Twente University for Technical and Social Sciences PO Box 217 7500 AE Enschede The Netherlands Phone: +31-53-4893400 Fax: +31-53-4893114 Email: memo@mathutwentenl
More informationTough graphs and hamiltonian circuits
Discrete Mathematics 306 (2006) 910 917 www.elsevier.com/locate/disc Tough graphs and hamiltonian circuits V. Chvátal Centre de Recherches Mathématiques, Université de Montréal, Montréal, Canada Abstract
More informationEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory, Series B 96 (26) 571 576 www.elsevier.com/locate/jctb Every 3-connected, essentially 11-connected line graph is Hamiltonian Hong-Jian Lai a, Yehong Shao b, Hehui Wu a,
More informationPancyclicity of 4-connected {Claw, Generalized Bull} - free Graphs
Pancyclicity of 4-connected {Claw, Generalized Bull} - free Graphs Michael Ferrara 1 Silke Gehrke 2 Ronald Gould 2 Colton Magnant 3 Jeffrey Powell 4 November 7, 2012 Abstract A graph G is pancyclic if
More informationComputing Sharp 2-factors in Claw-free Graphs
Computing Sharp 2-factors in Claw-free Graphs Hajo Broersma and Daniël Paulusma Department of Computer Science, Durham University, DH1 3LE Durham, United Kingdom, {hajo.broersma,daniel.paulusma}@durham.ac.uk
More informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More informationThe Toughness of Cubic Graphs
The Toughness of Cubic Graphs Wayne Goddard Department of Mathematics University of Pennsylvania Philadelphia PA 19104 USA wgoddard@math.upenn.edu Abstract The toughness of a graph G is the minimum of
More informationEvery 3-Connected Claw-Free Z 8 -Free Graph Is Hamiltonian
Every 3-Connected Claw-Free Z 8 -Free Graph Is Hamiltonian Hong-Jian Lai, 1 Liming Xiong, 2,3 Huiya Yan, 4 and Jin Yan 5 1 DEPARTMENT OF MATHEMATICS WEST VIRGINIA UNIVERSITY, MORGANTOWN WEST VIRGINIA 26506
More informationColourings of cubic graphs inducing isomorphic monochromatic subgraphs
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs arxiv:1705.06928v2 [math.co] 10 Sep 2018 Marién Abreu 1, Jan Goedgebeur 2, Domenico Labbate 1, Giuseppe Mazzuoccolo 3 1 Dipartimento
More information9-Connected Claw-Free Graphs Are Hamilton-Connected
Journal of Combinatorial Theory, Series B 75, 167173 (1999) Article ID jctb.1998.1871, available online at http:www.idealibrary.com on 9-Connected Claw-Free Graphs Are Hamilton-Connected Stephan Brandt
More informationHighly Hamiltonian Graphs and Digraphs
Western Michigan University ScholarWorks at WMU Dissertations Graduate College 6-017 Highly Hamiltonian Graphs and Digraphs Zhenming Bi Western Michigan University, zhenmingbi@gmailcom Follow this and
More informationToughness and spanning trees in K 4 -minor-free graphs
Toughness and spanning trees in K 4 -minor-free graphs M. N. Ellingham Songling Shan Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, TN 37240 mark.ellingham@vanderbilt.edu
More informationIndependent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs
Journal of Combinatorial Theory, Series B 72, 104109 (1998) Article No. TB971794 Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs Carsten Thomassen Department of Mathematics,
More informationSupereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationColourings of cubic graphs inducing isomorphic monochromatic subgraphs
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs arxiv:1705.06928v1 [math.co] 19 May 2017 Marién Abreu 1, Jan Goedgebeur 2, Domenico Labbate 1, Giuseppe Mazzuoccolo 3 1 Dipartimento
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationarxiv: v1 [math.co] 27 Aug 2015
arxiv:1508.06934v1 [math.co] 27 Aug 2015 TRIANGLE-FREE UNIQUELY 3-EDGE COLORABLE CUBIC GRAPHS SARAH-MARIE BELCASTRO AND RUTH HAAS Abstract. This paper presents infinitely many new examples of triangle-free
More informationInduced Cycles of Fixed Length
Induced Cycles of Fixed Length Terry McKee Wright State University Dayton, Ohio USA terry.mckee@wright.edu Cycles in Graphs Vanderbilt University 31 May 2012 Overview 1. Investigating the fine structure
More informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
More informationFast exact algorithms for hamiltonicity in claw-free graphs
Fast exact algorithms for hamiltonicity in claw-free graphs Hajo Broersma 1, Fedor V. Fomin 2, Pim van t Hof 1, and Daniël Paulusma 1 1 Department of Computer Science, University of Durham, Science Laboratories,
More informationInfinite circuits in infinite graphs
Infinite circuits in infinite graphs Henning Bruhn Universität Hamburg R. Diestel, A. Georgakopoulos, D. Kühn, P. Sprüssel, M. Stein Henning Bruhn (U Hamburg) Infinite circuits Haifa 08 1 / 25 Locally
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationGRAPHS WITH MAXIMAL INDUCED MATCHINGS OF THE SAME SIZE. 1. Introduction
GRAPHS WITH MAXIMAL INDUCED MATCHINGS OF THE SAME SIZE PHILIPPE BAPTISTE, MIKHAIL Y. KOVALYOV, YURY L. ORLOVICH, FRANK WERNER, IGOR E. ZVEROVICH Abstract. A graph is well-indumatched if all its maximal
More informationDisjoint Path Covers in Cubes of Connected Graphs
Disjoint Path Covers in Cubes of Connected Graphs Jung-Heum Park a, Insung Ihm b, a School of Computer Science and Information Engineering The Catholic University of Korea, Bucheon, Korea b Department
More informationImproved degree conditions for 2-factors with k cycles in hamiltonian graphs
Improved degree conditions for -factors with k cycles in hamiltonian graphs Louis DeBiasio 1,4, Michael Ferrara,, Timothy Morris, December 4, 01 Abstract In this paper, we consider conditions that ensure
More informationSolution to a problem on hamiltonicity of graphs under Oreand Fan-type heavy subgraph conditions
Noname manuscript No. (will be inserted by the editor) Solution to a problem on hamiltonicity of graphs under Oreand Fan-type heavy subgraph conditions Bo Ning Shenggui Zhang Binlong Li Received: date
More informationDecomposing plane cubic graphs
Decomposing plane cubic graphs Kenta Ozeki and Dong Ye Abstract It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family
More informationToughness, connectivity and the spectrum of regular graphs
Outline Toughness, connectivity and the spectrum of regular graphs Xiaofeng Gu (University of West Georgia) Joint work with S.M. Cioabă (University of Delaware) AEGT, August 7, 2017 Outline Outline 1 Toughness
More informationCycle Double Cover Conjecture
Cycle Double Cover Conjecture Paul Clarke St. Paul's College Raheny January 5 th 2014 Abstract In this paper, a proof of the cycle double cover conjecture is presented. The cycle double cover conjecture
More informationTHE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS
Discussiones Mathematicae Graph Theory 27 (2007) 507 526 THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS Michael Ferrara Department of Theoretical and Applied Mathematics The University
More informationGraph Theory and Interconnection Networks
Graph Theory and Interconnection Networks Lih-Hsing Hsu and Cheng-Kuan Lin @ CRC Press Taylor & Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor & Francis Group, an informa
More informationSpanning 2-trails from degree sum conditions
This is a preprint of an article accepted for publication in the Journal of Graph Theory c 2004(?) (copyright owner as specified in the Journal) Spanning 2-trails from degree sum conditions M. N. Ellingham
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More informationarxiv: v1 [math.co] 21 Jan 2016
Cores, joins and the Fano-flow conjectures Ligang Jin, Giuseppe Mazzuoccolo, Eckhard Steffen August 13, 2018 arxiv:1601.05762v1 [math.co] 21 Jan 2016 Abstract The Fan-Raspaud Conjecture states that every
More informationA counterexample to the pseudo 2-factor isomorphic graph conjecture
A counterexample to the pseudo 2-factor isomorphic graph conjecture Jan Goedgebeur a,1 arxiv:1412.3350v2 [math.co] 27 May 2015 Abstract a Department of Applied Mathematics, Computer Science & Statistics
More informationTypes of triangle and the impact on domination and k-walks
Types of triangle and the impact on domination and k-walks Gunnar Brinkmann Applied Mathematics, Computer Science and Statistics Krijgslaan 8 S9 Ghent University B9 Ghent gunnar.brinkmann@ugent.be Kenta
More informationSpanning Paths in Infinite Planar Graphs
Spanning Paths in Infinite Planar Graphs Nathaniel Dean AT&T, ROOM 2C-415 600 MOUNTAIN AVENUE MURRAY HILL, NEW JERSEY 07974-0636, USA Robin Thomas* Xingxing Yu SCHOOL OF MATHEMATICS GEORGIA INSTITUTE OF
More informationCYCLE STRUCTURES IN GRAPHS. Angela K. Harris. A thesis submitted to the. University of Colorado Denver. in partial fulfillment
CYCLE STRUCTURES IN GRAPHS by Angela K. Harris Master of Science, University of South Alabama, 003 A thesis submitted to the University of Colorado Denver in partial fulfillment of the requirements for
More informationExtending a perfect matching to a Hamiltonian cycle
Downloaded from orbit.dtu.dk on: Sep 20, 2018 Extending a perfect matching to a Hamiltonian cycle Alahmadi, Adel; Aldred, Robert E. L.; Alkenani, Ahmad; Hijazi, Rola; Solé, P.; Thomassen, Carsten Published
More informationAALBORG UNIVERSITY. Connected factors in graphs - a survey. To appear in Graphs and Combinatorics Vol 21, 1-26 (2005)
AALBORG UNIVERSITY Connected factors in graphs - a survey To appear in Graphs and Combinatorics Vol 21, 1-26 (2005) by Mekkia Kouider and Preben Dahl Vestergaard R-2005-25 June 2005 Department of Mathematical
More informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs L. Addario-Berry, F. Havet and S. Thomassé September 20, 2005 Abstract We show that every oriented path of order n 4 with two blocks is contained in every
More informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
More informationCycle Spectra of Hamiltonian Graphs
Cycle Spectra of Hamiltonian Graphs Kevin G. Milans, Dieter Rautenbach, Friedrich Regen, and Douglas B. West July, 0 Abstract We prove that every graph consisting of a spanning cycle plus p chords has
More informationThe Reduction of Graph Families Closed under Contraction
The Reduction of Graph Families Closed under Contraction Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 November 24, 2004 Abstract Let S be a family of graphs. Suppose
More informationSpanning Halin Subgraphs Involving Forbidden Subgraphs
Georgia State University ScholarWorks @ Georgia State University Mathematics Dissertations Department of Mathematics and Statistics 5-9-2016 Spanning Halin Subgraphs Involving Forbidden Subgraphs Ping
More informationOn Barnette's Conjecture. Jens M. Schmidt
On Barnette's Conjecture Jens M. Schmidt Hamiltonian Cycles Def. A graph is Hamiltonian if it contains a Hamiltonian cycle, i.e., a cycle that contains every vertex exactly once. William R. Hamilton 3-Connectivity
More informationCycle Double Covers and Semi-Kotzig Frame
Cycle Double Covers and Semi-Kotzig Frame Dong Ye and Cun-Quan Zhang arxiv:1105.5190v1 [math.co] 26 May 2011 Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310 Emails: dye@math.wvu.edu;
More informationHamilton cycles and closed trails in iterated line graphs
Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationPancyclicity in claw-free graphs
Discrete Mathematics 56 (00) 151 160 www.elsevier.com/locate/disc Pancyclicity in claw-free graphs R.J. Gould, F. Pfender Department of Mathematics and Computer Science, Emory University, Atlanta, GA 303,
More informationHAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH
HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH MICHAEL J. FERRARA, MICHAEL S. JACOBSON UNIVERSITY OF COLORADO DENVER DENVER, CO 8017 ANGELA HARRIS UNIVERSITY OF WISCONSIN-WHITEWATER WHITEWATER, WI
More informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
More informationNowhere-zero 3-flows in triangularly connected graphs
Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan 1, Hongjian Lai 2, Rui Xu 3, Cun-Quan Zhang 2, Chuixiang Zhou 4 1 Center for Discrete Mathematics Fuzhou University Fuzhou, Fujian 350002,
More informationarxiv: v1 [cs.dm] 24 Jan 2008
5-cycles and the Petersen graph arxiv:0801.3714v1 [cs.dm] 24 Jan 2008 M. DeVos, V. V. Mkrtchyan, S. S. Petrosyan, Department of Mathematics, Simon Fraser University, Canada Department of Informatics and
More informationOn a conjecture concerning the Petersen graph
On a conjecture concerning the Petersen graph Donald Nelson Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, USA dnelson@mtsu.edu Michael D. Plummer Department
More informationarxiv: v1 [math.co] 22 Jan 2018
arxiv:1801.07025v1 [math.co] 22 Jan 2018 Spanning trees without adjacent vertices of degree 2 Kasper Szabo Lyngsie, Martin Merker Abstract Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that
More information1-factor and cycle covers of cubic graphs
1-factor and cycle covers of cubic graphs arxiv:1209.4510v [math.co] 29 Jan 2015 Eckhard Steffen Abstract Let G be a bridgeless cubic graph. Consider a list of k 1-factors of G. Let E i be the set of edges
More informationCORES, JOINS AND THE FANO-FLOW CONJECTURES
Discussiones Mathematicae Graph Theory 38 (2018) 165 175 doi:10.7151/dmgt.1999 CORES, JOINS AND THE FANO-FLOW CONJECTURES Ligang Jin, Eckhard Steffen Paderborn University Institute of Mathematics and Paderborn
More informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationGroup flow, complex flow, unit vector flow, and the (2+)-flow conjecture
Downloaded from orbit.dtu.dk on: Jan 14, 2019 Group flow, complex flow, unit vector flow, and the (2+)-flow conjecture Thomassen, Carsten Published in: Journal of Combinatorial Theory. Series B Link to
More informationBounds on the Traveling Salesman Problem
Bounds on the Traveling Salesman Problem Sean Zachary Roberson Texas A&M University MATH 613, Graph Theory A common routing problem is as follows: given a collection of stops (for example, towns, stations,
More informationNeighborhood intersections and Hamiltonicity in almost claw-free graphs
Discrete Mathematics 243 (2002) 171 185 www.elsevier.com/locate/disc Neighborhood intersections and Hamiltonicity in almost claw-free graphs Mingquan Zhan Department of Mathematics, West Virginia University,
More informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationA shorter proof of Thomassen s theorem on Tutte paths in plane graphs
A shorter proof of Thomassen s theorem on Tutte paths in plane graphs Kenta Ozeki National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan and JST, ERATO, Kawarabayashi
More informationStrongly 2-connected orientations of graphs
Downloaded from orbit.dtu.dk on: Jul 04, 2018 Strongly 2-connected orientations of graphs Thomassen, Carsten Published in: Journal of Combinatorial Theory. Series B Link to article, DOI: 10.1016/j.jctb.2014.07.004
More informationNowhere zero flow. Definition: A flow on a graph G = (V, E) is a pair (D, f) such that. 1. D is an orientation of G. 2. f is a function on E.
Nowhere zero flow Definition: A flow on a graph G = (V, E) is a pair (D, f) such that 1. D is an orientation of G. 2. f is a function on E. 3. u N + D (v) f(uv) = w ND f(vw) for every (v) v V. Example:
More informationHamiltonicity in Connected Regular Graphs
Hamiltonicity in Connected Regular Graphs Daniel W. Cranston Suil O April 29, 2012 Abstract In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltonian. This
More informationUniversity of Twente. Faculty of Mathematical Sciences. Toughness and hamiltonicity in k-trees. University for Technical and Social Sciences
Faculty of Mathematical Sciences University of Twente University for Technical and Social Sciences P.O. Box 17 7500 AE Enschede The Netherlands Phone: +31-53-4893400 Fax: +31-53-4893114 Email: memo@math.utwente.nl
More informationFlows in Graphs and Related Problems název disertace. Komise pro obhajoby doktorských disertací v oboru Matematické struktury
Akademie věd České republiky Teze doktorské disertační práce k získání vědeckého titulu doktor věd ve skupině věd fyzikálně-matematických Flows in Graphs and Related Problems název disertace Komise pro
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationarxiv: v1 [cs.dm] 12 Jun 2016
A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey
More informationCYCLE DOUBLE COVERS OF INFINITE PLANAR GRAPHS
Discussiones Mathematicae Graph Theory 36 (2016) 523 544 doi:10.7151/dmgt.1879 CYCLE DOUBLE COVERS OF INFINITE PLANAR GRAPHS Mohammad Javaheri 515 Loudon Road School of Science, Siena College Loudonville,
More informationGraphs and digraphs with all 2 factors isomorphic
Graphs and digraphs with all 2 factors isomorphic M. Abreu, Dipartimento di Matematica, Università della Basilicata, I-85100 Potenza, Italy. e-mail: abreu@math.fau.edu R.E.L. Aldred, University of Otago,
More informationLong cycles in 3-cyclable graphs
Long cycles in 3-cyclable graphs D. Bauer 1 L. McGuire 1 H. Trommel 2 H. J. Veldman 2 1 Department of Mathematical Sciences, Stevens Institute of Technology Hoboken, NJ 07030, USA 2 Faculty of Applied
More informationTHE ROBUST COMPONENT STRUCTURE OF DENSE REGULAR GRAPHS AND APPLICATIONS
THE ROBUST COMPONENT STRUCTURE OF DENSE REGULAR GRAPHS AND APPLICATIONS DANIELA KÜHN, ALLAN LO, DERYK OSTHUS AND KATHERINE STADEN Abstract. In this paper, we study the large-scale structure of dense regular
More informationCycle lengths in sparse graphs
Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value
More informationCHVÁTAL-ERDŐS CONDITION AND PANCYCLISM
Discussiones Mathematicae Graph Theory 26 (2006 ) 335 342 8 9 13th WORKSHOP 3in1 GRAPHS 2004 Krynica, November 11-13, 2004 CHVÁTAL-ERDŐS CONDITION AND PANCYCLISM Evelyne Flandrin, Hao Li, Antoni Marczyk
More informationCycles with consecutive odd lengths
Cycles with consecutive odd lengths arxiv:1410.0430v1 [math.co] 2 Oct 2014 Jie Ma Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213. Abstract It is proved that there
More informationAdvanced Combinatorial Optimization Updated February 18, Lecture 5. Lecturer: Michel X. Goemans Scribe: Yehua Wei (2009)
18.438 Advanced Combinatorial Optimization Updated February 18, 2012. Lecture 5 Lecturer: Michel X. Goemans Scribe: Yehua Wei (2009) In this lecture, we establish the connection between nowhere-zero k-flows
More informationColouring powers of graphs with one cycle length forbidden
Colouring powers of graphs with one cycle length forbidden Ross J. Kang Radboud University Nijmegen CWI Networks & Optimization seminar 1/2017 Joint work with François Pirot. Example 1: ad hoc frequency
More informationOn Perfect Matching Coverings and Even Subgraph Coverings
On Perfect Matching Coverings and Even Subgraph Coverings Xinmin Hou, Hong-Jian Lai, 2 and Cun-Quan Zhang 2 SCHOOL OF MATHEMATICAL SCIENCES UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA HEFEI, ANHUI, 20026
More informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
More informationarxiv: v1 [math.co] 28 Oct 2015
Noname manuscript No. (will be inserted by the editor) A note on the Ramsey number of even wheels versus stars Sh. Haghi H. R. Maimani arxiv:1510.08488v1 [math.co] 28 Oct 2015 Received: date / Accepted:
More information