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)- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
- Cycle games on graphs
- A survey of graphs with known or bounded crossing numbers
- Toughness in graphs -- a survey
- Acyclic 3-coloring of generalized Petersen graphs
- Rainbow domination regular graphs that are not vertex transitive
- scientific article; zbMATH DE number 811600 (Why is no real title available?)
- GI-graphs: a new class of graphs with many symmetries
- The metric dimension of some generalized Petersen graphs
- Component connectivity of generalized Petersen graphs
- scientific article; zbMATH DE number 2230266 (Why is no real title available?)
- An improved binary programming formulation for the secure domination problem
- On the 2-rainbow independent domination numbers of some graphs
- On the Hamilton connectivity of generalized Petersen graphs
- On the locating chromatic number of certain barbell graphs
- Combinatorics of colorings of Dűrer graph, Dűrer solid in \textit{Melencolia I}, their heptagonal analogues and antiprisms for all irreducible representations: chirality, dynamics, NMR spectra and enumerations
- On the total coloring of generalized Petersen graphs
- Trivalent vertex-transitive bi-dihedrants
- Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- Generalizing the generalized Petersen graphs
- Jacobsthal Numbers in Generalized Petersen Graphs
- Edge irregular reflexive labeling for disjoint union of generalized Petersen graph
- Beyond symmetry in generalized Petersen graphs
- Combinatorics of random walks on graphs and walk-entropies: generalized Petersen and isomerization graphs
- A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra
- On double Roman domination problem for several graph classes
- On the independent domination number of the generalized Petersen graphs
- Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\)
- Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\)
- Edge-transitive core-free nest graphs
- A note on the generalized Petersen graphs that are also Cayley graphs
- Distinguishing graphs via cycles
- On the reliability of generalized Petersen graphs
- Hamilton cycles in double generalized Petersen graphs
- Cubic vertex-transitive graphs of order 2pq
- The cost of perfection for matchings in graphs
- On metric dimension of subdivided honeycomb network and Aztec diamond network
- Vertex domination of generalized Petersen graphs
- Embedding generalized Petersen graph in books
- The Laplacian and signless Laplacian spectrum of semi-Cayley graphs over abelian groups
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
- Cyclically orderable generalized Petersen graphs
- Determining number of some families of cubic graphs
- Maker-Breaker total domination game on cubic graphs
- On perfectly one–factorable cubic graphs
- The classification of Hamiltonian generalized Petersen graphs
- On 3-component domination numbers in graphs
- Isomorphism checking of \(I\)-graphs
- On cycle permutation graphs
- Independent rainbow domination of graphs
- Þ-energy of generalized Petersen graphs
- Hamilton-connectivity of line graphs with application to their detour index
- On the neighbor-distinguishing in generalized Petersen graphs
- On the minimum vertex cover of generalized Petersen graphs
- Double Roman domination in graphs: algorithmic complexity
- On \((a,b)\)-consecutive Petersen graphs
- Vertex neighborhood restricted edge achromatic sums of graphs
- On rainbow domination of generalized Petersen graphs P ( c k , k )
- Vertex-Magic Total Labelings Of Generalized Petersen Graphs
- Hamiltonian cycles in generalized Petersen graphs
- Classification and characterizations of snarks
- The 2-rainbow bondage number in generalized Petersen graphs
- On the odd girth and the circular chromatic number of generalized Petersen graphs
- On abelian \(\ell\)-towers of multigraphs. III
- Jacobsthal numbers in generalised Petersen graphs
- Intersection of longest cycle and largest bond in 3-connected graphs
- Trivalent dihedrants and bi-dihedrants
- There are no cubic graphs on 26 vertices with crossing number 10 or 11
- A tight upper bound for 2-rainbow domination in generalized Petersen graphs
- Characterization of generalised Petersen graphs that are Kronecker covers
- Distinguishing graphs via cycles
- On the 2-extendability of the generalized Petersen graphs
- The crossing numbers of generalized Petersen graphs with small order
- On 2-distance-balancedness of vertex transitive generalized Petersen graphs
- Generalized Petersen graphs which are cycle permutation graphs
- Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
- A classification of cubic bicirculants
- A generalized Beraha conjecture for non-planar graphs
- Is the five-flow conjecture almost false?
- Binary programming formulations for the upper domination problem
- On the constant metric dimension of generalized Petersen graphs \(P(n, 4)\)
- Complexes of graphs with bounded independence number
- Petersen type \(n\)-circulant and weak metacirculant
- Automorphism groups and the full state spaces of the Petersen graph generalizations of \(G_{32}\)
- Strong edge chromatic index of the generalized Petersen graphs
- The numerical invariants concerning the total domination for generalized Petersen graphs
- On the binary locating-domination number of regular and strongly-regular graphs
- The core of a complementary prism
- Classification of edge-transitive nest graphs
- A survey on undirected circulant graphs
- On certain edge-transitive bicirculants of twice odd order
- On rainbow domination numbers of graphs
- Well-quasi-orderings and sets of finite sequences
- Recognizing generalized Petersen graphs in linear time
- On the \([1,2]\)-domination number of generalized Petersen graphs
- On the domination number of the generalized Petersen graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Finding Hamiltonian cycle in graphs of bounded treewidth. Experimental evaluation
- 2-rainbow domination of generalized Petersen graphs P(n,2)
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)