Pages that link to "Item:Q4857433"
From MaRDI portal
The following pages link to 2‐connected coverings of bounded degree in 3‐connected graphs (Q4857433):
Displaying 19 items.
- A Dirac theorem for trestles (Q427855) (← links)
- Enumerative properties of rooted circuit maps (Q604989) (← links)
- Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds (Q707019) (← links)
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs (Q875943) (← links)
- 3-trees with few vertices of degree 3 in circuit graphs (Q1011698) (← links)
- On certain spanning subgraphs of embeddings with applications to domination (Q1044949) (← links)
- On 2-connected spanning subgraphs with low maximum degree (Q1127880) (← links)
- Subgraphs of graphs on surfaces with high representativity (Q1417964) (← links)
- On \(3\)-connected plane graphs without triangular faces (Q1569046) (← links)
- 3-trees in polyhedral maps (Q1802763) (← links)
- \([2,3]\)-factors in a 3-connected infinite planar graph. (Q1847585) (← links)
- Long cycles in graphs on a fixed surface (Q1850617) (← links)
- Embedding coverings of 2-paths with 3-paths (Q1876693) (← links)
- Local neighbor-distinguishing index of graphs (Q2693079) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- Face-width of embedded graphs (Q2702745) (← links)
- 2-IRREDUCIBILITY OF SPATIAL GRAPHS (Q3379420) (← links)
- Rooted minors and locally spanning subgraphs (Q6143382) (← links)
- 2-connected spanning subgraphs of circuit graphs (Q6635095) (← links)