The ubiquitous Petersen graph
From MaRDI portal
Publication:1198655
DOI10.1016/0012-365X(92)90649-ZzbMath0778.05070MaRDI QIDQ1198655
Robin J. Wilson, Gary Chartrand, Héctor Hevia
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ Refined inertias of strongly connected orientations of the Petersen graph ⋮ Unnamed Item ⋮ Recognizing generalized Petersen graphs in linear time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The classification of Hamiltonian generalized Petersen graphs
- The Chvátal-Erdős condition and pancyclic line-graphs
- The smallest graphs with certain adjacency properties
- A Ramsey-type theorem for traceable graphs
- A nine point theorem for 3-connected graphs
- Hamiltonian paths in vertex-symmetric graphs of order 5p
- Hamilton cycles in regular 2-connected graphs
- Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
- A generalization of Ore's Theorem involving neighborhood unions
- Cycles through ten vertices in 3-connected cubic graphs
- A note on Hamiltonian circuits
- Double cycle covers and the petersen graph
- A class of Hamiltonian regular graphs
- Reduced graphs of diameter two
- Minimalk-saturated and color critical graphs of prescribed minimum degree
- Largest bipartite subgraphs in triangle-free graphs with maximum degree three
- An 11-vertex theorem for 3-connected cubic graphs
- Extremal bipartite subgraphs of cubic triangle-free graphs
- A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”
- On Critical Graphs of Diameter 2
This page was built for publication: The ubiquitous Petersen graph
