A theorem on tait colorings with an application to the generalized Petersen graphs
From MaRDI portal
(Redirected from Publication:5565637)
Cited in
(only showing first 100 items - show all)- 2-rainbow domination of generalized Petersen graphs P(n,2)
- The crossing numbers of generalized Petersen graphs with small order
- Vertex domination of generalized Petersen graphs
- On the Hamilton connectivity of generalized Petersen graphs
- The classification of Hamiltonian generalized Petersen graphs
- Automorphism groups and the full state spaces of the Petersen graph generalizations of \(G_{32}\)
- A result on Hamiltonian cycles in generalized Petersen graphs
- Hamiltonian cycles in generalized Petersen graphs
- On \((a,b)\)-consecutive Petersen graphs
- A note on the generalized Petersen graphs that are also Cayley graphs
- Classification and characterizations of snarks
- A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra
- On the reliability of generalized Petersen graphs
- Hamilton cycles in double generalized Petersen graphs
- Weak metacirculants of odd prime power order
- On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)
- The metric dimension of some generalized Petersen graphs
- On the locating chromatic number of certain barbell graphs
- Isomorphism checking of \(I\)-graphs
- On the minimum vertex cover of generalized Petersen graphs
- Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\)
- Hamilton-connectivity of line graphs with application to their detour index
- On the neighbor-distinguishing in generalized Petersen graphs
- On certain edge-transitive bicirculants of twice odd order
- The number of switching isomorphism classes of signed graphs associated with particular graphs
- Recognizing generalized Petersen graphs in linear time
- The numerical invariants concerning the total domination for generalized Petersen graphs
- Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\)
- Petersen type \(n\)-circulant and weak metacirculant
- Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs
- Edge irregular reflexive labeling for disjoint union of generalized Petersen graph
- On the odd girth and the circular chromatic number of generalized Petersen graphs
- Trivalent vertex-transitive bi-dihedrants
- On the number of geodesics of Petersen graph \(\mathrm{GP}(n,2)\)
- Independent rainbow domination of graphs
- Strong edge chromatic index of the generalized Petersen graphs
- On the \([1,2]\)-domination number of generalized Petersen graphs
- A tight upper bound for 2-rainbow domination in generalized Petersen graphs
- On the domination number of the generalized Petersen graphs
- Toughness in graphs -- a survey
- Structural and computational results on platypus graphs
- There are no cubic graphs on 26 vertices with crossing number 10 or 11
- The seriation problem in the presence of a double Fiedler value
- Distinguishing graphs via cycles
- On the total coloring of generalized Petersen graphs
- A survey on undirected circulant graphs
- Component connectivity of generalized Petersen graphs
- The Laplacian and signless Laplacian spectrum of semi-Cayley graphs over abelian groups
- Jacobsthal Numbers in Generalized Petersen Graphs
- Embedding generalized Petersen graph in books
- The cost of perfection for matchings in graphs
- Cubic vertex-transitive graphs of order 2pq
- Power domination in cylinders, tori, and generalized Petersen graphs
- Jacobsthal numbers in generalised Petersen graphs
- On the domination number of some graphs
- On perfectly one–factorable cubic graphs
- GI-graphs: a new class of graphs with many symmetries
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
- Well-quasi-orderings and sets of finite sequences
- On the independent domination number of the generalized Petersen graphs
- Total irregularity strength of disjoint union of isomorphic copies of generalized Petersen graph
- Is the five-flow conjecture almost false?
- The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
- On the minimum number of Hamiltonian cycles in regular graphs
- On the constant metric dimension of generalized Petersen graphs \(P(n, 4)\)
- Vertex-Magic Total Labelings Of Generalized Petersen Graphs
- scientific article; zbMATH DE number 811600 (Why is no real title available?)
- On rainbow domination numbers of graphs
- Finding Hamiltonian cycle in graphs of bounded treewidth. Experimental evaluation
- Trivalent dihedrants and bi-dihedrants
- REGNANT AND CAPTIVE DOMINATION IN SOME GENERALIZED GRAPHS
- CERTAIN OPERATION OF GENERALIZED PETERSEN GRAPHS HAVING LOCATING-CHROMATIC NUMBER FIVE
- Matching book thickness of generalized Petersen graphs
- A survey of graphs with known or bounded crossing numbers
- The 2-rainbow bondage number in generalized Petersen graphs
- A note on isomorphic generalized Petersen graphs with an application to the crossing number of \(GP[3k-1,k]\) and \(GP[3k+1,k]\)
- \([1,2]\)-domination in generalized Petersen graphs
- scientific article; zbMATH DE number 2230266 (Why is no real title available?)
- Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
- Determining number of some families of cubic graphs
- Complexes of graphs with bounded independence number
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
- Acyclic 3-coloring of generalized Petersen graphs
- A generalized Beraha conjecture for non-planar graphs
- Maker-Breaker total domination game on cubic graphs
- On metric dimension of subdivided honeycomb network and Aztec diamond network
- Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs
- Vertex neighborhood restricted edge achromatic sums of graphs
- Binary programming formulations for the upper domination problem
- The core of a complementary prism
- Classification of edge-transitive nest graphs
- Rainbow domination regular graphs that are not vertex transitive
- Double Roman domination in graphs: algorithmic complexity
- Beyond symmetry in generalized Petersen graphs
- Þ-energy of generalized Petersen graphs
- On the 2-rainbow independent domination numbers of some graphs
- Cyclically orderable generalized Petersen graphs
- On the binary locating-domination number of regular and strongly-regular graphs
- Cyclic base ordering of generalized Petersen graphs
- On rainbow domination of generalized Petersen graphs P ( c k , k )
This page was built for publication: A theorem on tait colorings with an application to the generalized Petersen graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565637)