Leaf-Critical and Leaf-Stable Graphs

DOI10.1002/jgt.22034zbMath1359.05072MaRDI QIDQ2978184

Gábor Wiener

Publication date: 21 April 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22034

zbMATH Keywords

spanning tree; Hamiltonian cycle; Hamiltonian path; hypotraceable graph; hypohamiltonian graph

Mathematics Subject Classification ID

05C05: Trees

05C45: Eulerian and Hamiltonian graphs

Related Items

$K_2$-Hamiltonian Graphs: I, On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs, Hamiltonicity, minimum degree and leaf number, Gallai's question and constructions of almost hypotraceable graphs, Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs, On minimum leaf spanning trees and a criticality notion, Spiders everywhere, On the minimum leaf number of cubic graphs, Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cubic planar hypohamiltonian and hypotraceable graphs
• New families of hypohamiltonian graphs
• Planar and infinite hypohamiltonian and hypotraceable graphs
• Hypohamiltonian and hypotraceable graphs
• Spanning spiders and light-splitting switches
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
• A two-connected planar graph without concurrent longest paths
• Vertices missed by longest paths or circuits
• On planar hypohamiltonian graphs
• On longest paths and circuits in graphs.
• On Detours in Graphs¹
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
• Flip-Flops in Hypohamiltonian Graphs