scientific article; zbMATH DE number 227006

Publication date: 6 July 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

flows colorability Petersen graph factors

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (only showing first 100 items - show all)

Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs ⋮ Topological symmetry groups of the Petersen graph ⋮ SOME RESULTS ON WEAK DOMINATION IN GRAPHS ⋮ On the spectrum of the closed unit graphs ⋮ On the edge dimension and the fractional edge dimension of graphs ⋮ The core of a complementary prism ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Rainbow domination regular graphs that are not vertex transitive ⋮ Unnamed Item ⋮ A family of multigraphs with large palette index ⋮ Unnamed Item ⋮ Some properties of the distance Laplacian eigenvalues of a graph ⋮ On Hypohamiltonian and Almost Hypohamiltonian Graphs ⋮ On some aspects of the generalized Petersen graph ⋮ $K_2$-Hamiltonian Graphs: I ⋮ Characterization of perfect matching transitive graphs ⋮ Determining the edge metric dimension of the generalized Petersen graph $P(n, 3)$ ⋮ Tightness of sensitivity and proximity bounds for integer linear programs ⋮ A twelve vertex theorem for 3-connected claw-free graphs ⋮ Upper bounds on the bisection width of 3- and 4-regular graphs ⋮ On non-traceable, non-hypotraceable, arachnoid graphs ⋮ Designs associated with maximum independent sets of a graph ⋮ The construction and reduction of strong snarks ⋮ Eulerian colorings and the bipartizing matchings conjecture of Fleischner ⋮ Symmetric cubic graphs of small girth ⋮ On Perfect Matching Coverings and Even Subgraph Coverings ⋮ Unnamed Item ⋮ A new heuristic for detecting non-Hamiltonicity in cubic graphs ⋮ A generalization of a graph result of D. W. Hall ⋮ Generalizing the generalized Petersen graphs ⋮ Covering a cubic graph by 5 perfect matchings ⋮ Gallai's property for graphs in lattices on the torus and the Möbius strip ⋮ Structural and computational results on platypus graphs ⋮ There are no cubic graphs on 26 vertices with crossing number 10 or 11 ⋮ The edge chromatic difference sequence of a cubic graph ⋮ Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ Computing the automorphic chromatic index of certain snarks ⋮ Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ On the quantum symmetry of distance-transitive graphs ⋮ On bi-regular cages of even girth at least 8 ⋮ On the number of geodesics of Petersen graph $\mathrm{GP}(n,2)$ ⋮ On minimum leaf spanning trees and a criticality notion ⋮ Hamilton paths in generalized Petersen graphs ⋮ A classification of graphs whose subdivision graph is locally distance transitive ⋮ RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties ⋮ The Petersen graph is not 3-edge-colorable---a new proof ⋮ Recognizing generalized Petersen graphs in linear time ⋮ Six signed Petersen graphs, and their automorphisms ⋮ $k$-phase oscillator synchronization for graph coloring ⋮ Partial linear spaces and identifying codes ⋮ On the order of $(\{r,m\};g)$-cages of even girth ⋮ Irreducible pseudo 2-factor isomorphic cubic bipartite graphs ⋮ Vertex-magic labeling of regular graphs: disjoint unions and assemblages ⋮ Improved bounds for hypohamiltonian graphs ⋮ $k$-regular graphs with the circular chromatic index close to $k$ ⋮ Families of small regular graphs of girth 5 ⋮ Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs ⋮ Leaf-Critical and Leaf-Stable Graphs ⋮ Odd 2-factored snarks ⋮ Generation and properties of snarks ⋮ Monotonicity of the order of $(D;g)$-cages ⋮ On the connectivity of $(k,g)$-cages of even girth ⋮ The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ Perfect matching covers of cubic graphs of oddness 2 ⋮ On planar hypohamiltonian graphs ⋮ $\lambda$-numbers of several classes of snarks ⋮ Snarks, hypohamiltonian graphs and non-supereulerian graphs ⋮ Double graphs ⋮ On constructions of hypotraceable graphs ⋮ A family of regular graphs of girth 5 ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs ⋮ Graphs (networks) with golden spectral ratio ⋮ On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings ⋮ Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages ⋮ On upper bounds of odd girth cages ⋮ Lower bound of cyclic edge connectivity for $n$-extendability of regular graphs ⋮ Unnamed Item ⋮ Double covers of cubic graphs with oddness 4 ⋮ Distance-residual subgraphs ⋮ New families of graphs without short cycles and large size ⋮ Symmetric LDPC Codes and Local Testing ⋮ Chromatic sets of power graphs and their application to resource placement in multicomputer networks ⋮ Irreducible snarks of given order and cyclic connectivity ⋮ On $k$-pairable regular graphs ⋮ A new bound for the connectivity of cages ⋮ Cubic planar Hamiltonian graphs of various types ⋮ Leader election in oriented star graphs ⋮ On the minimum vertex cover of generalized Petersen graphs ⋮ Why do mathematicians need different ways of presenting mathematical objects? The case of Cayley graphs ⋮ How important are branching decisions: fooling MIP solvers ⋮ Treelike snarks ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ The connected metric dimension at a vertex of a graph ⋮ The clique operator on matching and chessboard graphs ⋮ A refined classification of symmetric cubic graphs ⋮ Small regular graphs of girth 7 ⋮ Edge selection for undirected graphs ⋮ Proof Without Words: The Automorphism Group of the Petersen Graph Is Isomorphic to S₅ ⋮ Maker-breaker resolving game

This page was built for publication: