Reflections on graph theory
From MaRDI portal
Publication:4722106
DOI10.1002/jgt.3190100308zbMath0614.05050OpenAlexW2041928734MaRDI QIDQ4722106
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100308
reduction theoremschromatic numberplanar triangulationErdős-Fajtlowicz theoremtheorem of Richmond, Robertson and Wormald
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99)
Related Items (91)
A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs ⋮ Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs ⋮ Every 4-connected line graph of a planar graph is Hamiltonian ⋮ Vertex-pancyclicity of edge-face-total graphs ⋮ Hamiltonian cycles in spanning subgraphs of line graphs ⋮ Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free 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 ⋮ On spanning disjoint paths in line graphs ⋮ On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs ⋮ Claw-free graphs---a survey ⋮ Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs ⋮ On a closure concept in claw-free graphs ⋮ Hamiltonian paths in spanning subgraphs of line graphs ⋮ Cycles through all finite vertex sets in infinite graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ Thomassen's conjecture for line graphs of 3-hypergraphs ⋮ Hamiltonicity of 6-connected line graphs ⋮ On even cycle decompositions of line graphs of cubic graphs ⋮ On 1-Hamilton-connected claw-free graphs ⋮ On Dominating Even Subgraphs in Cubic Graphs ⋮ On spanning tree packings of highly edge connected graphs ⋮ Good orientations of unions of edge‐disjoint spanning trees ⋮ The Hamiltonicity of essentially 9‐connected line graphs ⋮ On hamiltonian line graphs of hypergraphs ⋮ Ore's condition for completely independent spanning trees ⋮ Hamilton cycles in 5-connected line graphs ⋮ A short proof of the tree-packing theorem ⋮ Hamiltonian connected hourglass free line graphs ⋮ Construction sequences and certifying 3-connectivity ⋮ On 3-connected Hamiltonian line graphs ⋮ Even cycle decompositions of 4-regular graphs and line graphs ⋮ On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs ⋮ Collapsible graphs and Hamiltonian connectedness of line graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ 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 ⋮ On 3-edge-connected supereulerian graphs ⋮ How many conjectures can you stand? A survey ⋮ On \(s\)-Hamiltonian-connected line graphs ⋮ Collapsible graphs and Hamilton cycles of line graphs ⋮ On factors of 4-connected claw-free graphs ⋮ Pancyclicity of 4‐Connected, Claw‐Free, P10‐Free Graphs ⋮ Every 3-connected essentially 10-connected line graph is Hamilton-connected ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Submaps of maps. III: \(k\)-connected nonplanar maps ⋮ The spanning connectivity of line graphs ⋮ The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs ⋮ Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Toughness in graphs -- a survey ⋮ Every 3-connected, essentially 11-connected line graph is Hamiltonian ⋮ Hamiltonicity of 3-connected line graphs ⋮ The Ryjáček closure and a forbidden subgraph ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks ⋮ Path-comprehensive and vertex-pancyclic properties of super line graph \(\mathcal L_2(G)\) ⋮ Degree conditions on induced claws ⋮ A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ 2-factors with bounded number of components in claw-free graphs ⋮ Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs ⋮ Hamiltonicity in Partly claw-free graphs ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected ⋮ Spanning trails in essentially 4-edge-connected graphs ⋮ Collapsible graphs and Hamiltonicity of line graphs ⋮ Hamiltonicity of 3-arc graphs ⋮ Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs ⋮ Hamiltonian connectedness in 3-connected line graphs ⋮ Equivalence of Fleischner's and Thomassen's conjectures ⋮ On the extended Clark-Wormold Hamiltonian-like index problem ⋮ On \(s\)-Hamiltonian line graphs of claw-free graphs ⋮ Closure concepts for claw-free graphs ⋮ Hamilton cycles in 6-connected claw-free graphs (Extended abstract) ⋮ Chvátal’s t 0-Tough Conjecture ⋮ Spanning tree packing and 2-essential edge-connectivity ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Circumference of essentially 4-connected planar triangulations ⋮ Line graphs and forbidden induced subgraphs ⋮ All 4-connected line graphs of claw free graphs are Hamiltonian connected ⋮ Ons-Hamiltonian Line Graphs ⋮ 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 ⋮ Equivalence of Jackson's and Thomassen's conjectures ⋮ A condition on Hamilton-connected line graphs
Cites Work
This page was built for publication: Reflections on graph theory
