On dominating and spanning circuits in graphs
From MaRDI portal
Publication:1313841
DOI10.1016/0012-365X(92)00063-WzbMath0789.05061MaRDI QIDQ1313841
Publication date: 1 March 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
line graphdominating circuitcircuitHamilton cycleconjecture of Benhocineeulerian subgraphspanning circuit
Related Items
A note on minimum degree conditions for supereulerian graphs, Circumferences of 3-connected claw-free graphs, Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II, Searching for a cycle with maximum coverage in undirected graphs, Degree sums of adjacent vertices for traceability of claw-free graphs, Degree and neighborhood conditions for Hamiltonicity of claw-free graphs, Eulerian subgraphs containing given vertices and hamiltonian line graphs, A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices, On sufficient degree conditions for traceability of claw-free graphs, Hamilton‐connected {claw, net}‐free graphs, I, Traceability on 2-connected line graphs, Fan-type conditions for spanning Eulerian subgraphs, Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs, Hamiltonicity of claw-free graphs and Fan-type conditions, How many conjectures can you stand? A survey, Unnamed Item, On traceable line graphs, Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs, Spanning closed trails in graphs, Lai's conditions for spanning and dominating closed trails, Subpancyclicity of line graphs and degree sums along paths, 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices, Degree sum conditions for Hamiltonian index, Supereulerian line graphs, Traceability of line graphs
Cites Work
