scientific article; zbMATH DE number 3884206

MaRDI QIDQ3218161zbMATH OpenFDO

Authors John J. Watkins

Publication date 1983

zbMATH Keywords

chromatic index 4cubic graphcyclically 4-edge connectedgirthPetersen graphsnark

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 867669
• A survey on snarks and new results: Products, reducibility and a computer search
• Snarks without small cycles
• On generating snarks
• Snarks and reducibility

Cited in

(41)

• The construction and reduction of strong snarks
• Snarks and flow-snarks constructed from coloring-snarks.
• Classification and characterizations of snarks
• The hunting of the SNARK
• Snarks without small cycles
• Non-bicritical critical snarks
• Berge-Fulkerson coloring for some families of superposition snarks
• Morphology of small snarks
• Sigma coloring on powers of paths and some families of snarks
• Superposition of snarks revisited
• Some results on the structure of multipoles in the study of snarks
• The smallest nontrivial snarks of oddness 4
• Even cycles and even 2-factors in the line graph of a simple graph
• The hunting of a snark with total chromatic number 5
• Snarks and reducibility
• The Continuing Saga of Snarks
• The cost of perfection for matchings in graphs
• The crossing number of flower snarks and related graphs
• Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
• Construction of permutation snarks
• Circular chromatic index of type 1 Blanuša snarks
• Decomposition of snarks
• scientific article; zbMATH DE number 4093509 (Why is no real title available?)
• On generating snarks
• Circuits of length 5 in 2-factors of cubic graphs
• Snark designs
• scientific article; zbMATH DE number 867669 (Why is no real title available?)
• scientific article; zbMATH DE number 867711 (Why is no real title available?)
• Non-trivial snarks with given circular chromatic index
• On the number of colorings of a snark minus an edge
• Roman domination and independent Roman domination on graphs with maximum degree three
• Rotationally symmetric snarks from voltage graphs
• Permutation snarks of order \(2 \pmod{8}\)
• Measures of edge-uncolorability of cubic graphs
• On graceful colorings in subcubic trees
• Independent \([k]\)-Roman domination on graphs
• The domination and independent domination numbers of some families of snarks
• Bounds on graceful k-colorings of graphs
• Coupon coloring of snark graphs
• Infinite classes of dihedral snarks
• Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3218161)