On cycles through prescribed vertices in weakly separable graphs
From MaRDI portal
Publication:761466
DOI10.1016/0012-365X(83)90251-0zbMATH Open0556.05042MaRDI QIDQ761466FDOQ761466
Authors: Alexander Kelmans, Michael V. Lomonosov 
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- On short cycles through prescribed vertices of a graph
- Cyclic separability in graphs
- Cycles in graphs with prescribed stability number and connectivity
- On short cycles through prescribed vertices of a polyhedral graph
- Vertex‐disjoint cycles containing prescribed vertices
- Publication:4726282
- Cycles in graphs and related problems
- On some cycles in Wenger graphs
- Nonseparable graphs with a given number of cycles
- On the cyclability of graphs
Cites Work
- Matroid matching and some applications
- Über die Maximalzahl kantendisjunkter A-Wege
- On the graph structure of convex polyhedra in \(n\)-space
- Cycles and Connectivity in Graphs
- When m vertices in a k-connected graph cannot be walked round along a simple cycle
- Circuits and paths through specified nodes
- 4‐chrome Graphen und vollständige 4‐Graphen
- A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”
- On cycles through prescribed vertices in weakly separable graphs
Cited In (5)
- Title not available (Why is that?)
- Cycles through \(k+2\) vertices in \(k\)-connected graphs
- A look at cycles containing specified elements of a graph
- On cycles through prescribed vertices in weakly separable graphs
- A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
This page was built for publication: On cycles through prescribed vertices in weakly separable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761466)
