Reflections on graph theory
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Hamiltonian connectedness in 3-connected line graphs
- Submaps of maps. III: k-connected nonplanar maps
- Every 4-connected line graph of a planar graph is Hamiltonian
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- Equivalence of Fleischner's and Thomassen's conjectures
- Closure concepts for claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Every 3-connected essentially 10-connected line graph is Hamilton-connected
- Line graphs and forbidden induced subgraphs
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- Vertex-pancyclicity of edge-face-total graphs
- Berge-Fulkerson coloring for some families of superposition snarks
- Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs
- On the extended Clark-Wormold Hamiltonian-like index problem
- Spanning tree packing and 2-essential edge-connectivity
- Complete family reduction and spanning connectivity in line graphs
- A condition on Hamilton-connected line graphs
- On the s-hamiltonianicity of an hourglass-free line graph
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
- Even cycle decompositions of index 3 by a novel coloring technique
- Hamilton cycles in line graphs of 3-hypergraphs
- Thomassen's conjecture for line graphs of 3-hypergraphs
- On even cycle decompositions of line graphs of cubic graphs
- On s-Hamiltonicity of net-free line graphs
- On the line graph of a graph with diameter 2
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Shortness coefficient of cyclically 4-edge-connected cubic graphs
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- Equivalence of Jackson's and Thomassen's conjectures
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Hamiltonian paths in spanning subgraphs of line graphs
- Cycles through all finite vertex sets in infinite graphs
- Hamiltonian connected hourglass free line graphs
- Construction sequences and certifying 3-connectivity
- Recent advances on the Hamiltonian problem: survey III
- Toughness in graphs -- a survey
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- 2-factors with bounded number of components in claw-free graphs
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- On spanning disjoint paths in line graphs
- Polynomially determining spanning connectivity of locally connected line graphs
- Strongly even cycle decomposable 4-regular line graphs
- On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs
- On factors of 4-connected claw-free graphs
- Hamilton cycles in 6-connected claw-free graphs (extended abstract)
- On s-Hamiltonian line graphs
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
- Hamiltonian cycles in spanning subgraphs of line graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
- scientific article; zbMATH DE number 3863223 (Why is no real title available?)
- The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- Hamiltonicity in Partly claw-free graphs
- On 1-Hamilton-connected claw-free graphs
- On spanning tree packings of highly edge connected graphs
- Ore's condition for completely independent spanning trees
- Hamilton cycles in 5-connected line graphs
- A short proof of the tree-packing theorem
- On 3-connected Hamiltonian line graphs
- Even cycle decompositions of 4-regular graphs and line graphs
- Collapsible graphs and Hamiltonian connectedness of line graphs
- Pancyclicity of 4-connected, claw-free, \(P_{10}\)-free graphs
- Collapsible graphs and Hamilton cycles of line graphs
- On dominating even subgraphs in cubic graphs
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- A closure for 1-Hamilton-connectedness in claw-free graphs
- The spanning connectivity of line graphs
- scientific article; zbMATH DE number 6395187 (Why is no real title available?)
- Chvátal's \(t_{0}\)-tough conjecture
- Circumference of essentially 4-connected planar triangulations
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Good orientations of unions of edge‐disjoint spanning trees
- The Hamiltonicity of essentially 9‐connected line graphs
- On hamiltonian line graphs of hypergraphs
- Hamiltonicity of 6-connected line graphs
- On 3-edge-connected supereulerian graphs
- How many conjectures can you stand? A survey
- Spanning connectivity of \(K_{1 , r}\)-free split graphs
- On 2-factors with a specified number of components in line graphs
- A note on the 4-connected line graph of a planar triangulation containing two CISTs
- On the minimum degree of minimally t-tough, claw-free graphs
- On k-edge-Hamilton-connected line graphs
- On \(s\)-Hamiltonian-connected line graphs
- Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs
- Locally finite graphs with ends: A topological approach. II: Applications
- Hamiltonicity of 3-connected line graphs
- Every 4-connected \{claw, hourglass\}-free graph is 2-Hamiltonian
- Spanning connectivity in graphs and line graphs with Chvátal-Erdős conditions
- The Ryjáček closure and a forbidden subgraph
- Spanning trails in essentially 4-edge-connected graphs
- Collapsible graphs and Hamiltonicity of line graphs
- Hamiltonicity of 3-arc graphs
- On \(s\)-Hamiltonian-connected line graphs
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- Path-comprehensive and vertex-pancyclic properties of super line graph L₂(G)
- Degree conditions on induced claws
This page was built for publication: Reflections on graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4722106)
