Cycles through specified vertices of a graph
From MaRDI portal
Publication:1167744
DOI10.1007/BF02579268zbMath0492.05049MaRDI QIDQ1167744
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
Related Items
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs, The Chvátal-Erdős condition for prism-Hamiltonicity, An Improved Algorithm for Finding Cycles Through Elements, On the complexity of \(k\)-rainbow cycle colouring problems, On graphs whose orientations are determined by their Hermitian spectra, Parite des cycles contenant des sommets specifies d'un graphe, The Hamilton spaces of Cayley graphs on abelian groups, A nine point theorem for 3-connected graphs, Circuits through specified edges, Cycle traversability for claw-free graphs and polyhedral maps, Cycles through a prescribed vertex set in \(n\)-connected graphs., Unnamed Item, Relative length of longest paths and longest cycles in triangle-free graphs, K5-Subdivisions in Graphs, Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs, Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs, Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs, A look at cycles containing specified elements of a graph, Tools for counting odd cycles in graphs, One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture, Rooted topological minors on four vertices
Cites Work
- Unnamed Item
- Bridges and Hamiltonian circuits in planar graphs
- Circuits containing specified edges
- Note on circuits containing specified edges
- Applications of Menger's graph theorem
- A family of path properties for graphs
- A note on Hamiltonian circuits
- Characterizations of n-connected and n-line connected graphs
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Cycles and Connectivity in Graphs
