scientific article; zbMATH DE number 568792
From MaRDI portal
Publication:4294583
Recommendations
- Nonseparating cycles avoiding specific vertices
- Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
- Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs
- Note on non-separating and removable cycles in highly connected graphs
- Contractible cycles in graphs with girth at least 5
Cited in
(17)- Contractible cycles in graphs with girth at least 5
- Cyclic sieving phenomenon in non-crossing connected graphs
- scientific article; zbMATH DE number 6683596 (Why is no real title available?)
- Cyclic separability in graphs
- Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs
- Nonseparating Cycles in 4-Connected Graphs
- Non-separating even cycles in highly connected graphs
- Induced paths in 5-connected graphs
- Non-separating subgraphs in highly connected graphs
- Non-separating cycles and discrete Jordan curves
- Note on non-separating and removable cycles in highly connected graphs
- Chromatic number, induced cycles, and non-separating cycles
- Nonseparating cycles avoiding specific vertices
- Separating and nonseparating disjoint homotopic cycles in graph embeddings
- Class I graphs of nonnegative characteristic without special cycles
- Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
- Note on graphs without repeated cycle lengths
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294583)
