How many conjectures can you stand? A survey
From MaRDI portal
Publication:659764
DOI10.1007/S00373-011-1090-6zbMATH Open1234.05146OpenAlexW2142881856WikidataQ123359474 ScholiaQ123359474MaRDI QIDQ659764FDOQ659764
Hajo Broersma, Zdeněk Ryjáček, Petr Vrána
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/how-many-conjectures-can-you-stand-a-survey(82c4edb3-0df3-463d-9242-09c8315c0a07).html
Recommendations
- Conjectures
- Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}
- scientific article; zbMATH DE number 800548
- On the consistency of consistent conjectures
- A Look at the Faith Conjecture
- scientific article; zbMATH DE number 596336
- scientific article
- Consistency of conjectures and reactions?
line graphclaw-free graphclosurecollapsible graphcubic graphdominating closed trailsupereulerian graphHamilton-connectedHamiltonian graphsnarkdominating cyclecontractible graphcyclically 4-edge-connectedessentially 4-edge-connected
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Graphs without spanning closed trails
- On dominating and spanning circuits in graphs
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- A reduction method to find spanning Eulerian subgraphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Characterizations of derived graphs
- Hamiltonian results inK1,3-free graphs
- Supereulerian graphs: A survey
- Generation and properties of snarks
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Every 4-connected line graph of a planar graph is Hamiltonian
- Bounds of the number of disjoint spanning trees
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- Title not available (Why is that?)
- Hamilton cycles in 5-connected line graphs
- A Note on Sub-Eulerian Graphs
- Reflections on graph theory
- Title not available (Why is that?)
- On hamiltonian line graphs and connectivity
- A method in graph theory
- Not every 2-tough graph is Hamiltonian
- On some intriguing problems in Hamiltonian graph theory---a survey
- The edge Hamiltonian path problem is NP-complete
- Updating the hamiltonian problem—A survey
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Equivalences between Hamiltonicity and flow conjectures, and the sublinear defect property
- Title not available (Why is that?)
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- On factors of 4-connected claw-free graphs
- Title not available (Why is that?)
- Equivalence of Fleischner's and Thomassen's conjectures
- Cycles in digraphs– a survey
- Hamilton connectivity of line graphs and claw‐free graphs
- Hamiltonicity of 6-connected line graphs
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- A note about the dominating circuit conjecture
- Two-factors with few cycles in claw-free graphs
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
- Closure concepts: A survey
- Strengthening the closure concept in claw-free graphs
- Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
- Closure, path-factors and path coverings in claw-free graphs
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- Toughness and the existence ofk-factors
- Title not available (Why is that?)
- Toughness, minimum degree, and the existence of 2‐factors
- Contractibility techniques as a closure concept
- Circuit Double Covers of Graphs
- On some conjectures on cubic 3-connected graphs
- Computing sharp 2-factors in claw-free graphs
- A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
Cited In (16)
- On 1-Hamilton-connected claw-free graphs
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
- Recent advances on the Hamiltonian problem: survey III
- Forbidden pairs and the existence of a dominating cycle
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs
- Equivalences between Hamiltonicity and flow conjectures, and the sublinear defect property
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Thomassen's conjecture for line graphs of 3-hypergraphs
- On 2-factors with a specified number of components in line graphs
- Strongly even cycle decomposable 4-regular line graphs
- Equivalence of Jackson's and Thomassen's conjectures
- Hamilton cycles in line graphs of 3-hypergraphs
- The Nash-Williams conjecture and the dominating cycle conjecture
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
- On some intriguing problems in Hamiltonian graph theory---a survey
This page was built for publication: How many conjectures can you stand? A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659764)
