Pages that link to "Item:Q4068743"

The following pages link to Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable (Q4068743):

Displaying 50 items.

• On snarks that are far from being 3-edge colorable (Q281587) (← links)
• The cost of perfection for matchings in graphs (Q299061) (← links)
• On stable cycles and cycle double covers of graphs with large circumference (Q442360) (← links)
• Even cycle decompositions of 4-regular graphs and line graphs (Q442390) (← links)
• Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs (Q449212) (← links)
• Generation and properties of snarks (Q463288) (← links)
• Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
• \(\lambda\)-numbers of several classes of snarks (Q489727) (← links)
• AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) (Q516897) (← links)
• Computing the automorphic chromatic index of certain snarks (Q606388) (← links)
• Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
• On the partition and coloring of a graph by cliques (Q687122) (← links)
• Cycle double covers of infinite planar graphs (Q726631) (← links)
• Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
• Large Isaacs' graphs are maximally non-Hamilton-connected (Q750459) (← links)
• Computational results and new bounds for the circular flow number of snarks (Q785826) (← links)
• The number of cycles in 2-factors of cubic graphs (Q804602) (← links)
• Fano colourings of cubic graphs and the Fulkerson conjecture (Q817779) (← links)
• The circular chromatic index of some Class 2 graphs (Q878640) (← links)
• Edge reductions in cyclically \(k\)-connected cubic graphs (Q922553) (← links)
• Hamilton-chain saturated hypergraphs (Q966015) (← links)
• Smallest counterexample to the 5-flow conjecture has girth at least eleven (Q974466) (← links)
• Complexity of approximation of 3-edge-coloring of graphs (Q975462) (← links)
• Families of dot-product snarks on orientable surfaces of low genus (Q995768) (← links)
• Color-character of uncolorable cubic graphs (Q1036808) (← links)
• A note on Berge-Fulkerson coloring (Q1043939) (← links)
• A note on semiextensions of stable circuits (Q1044930) (← links)
• An algebraic theory of graph factorization (Q1055454) (← links)
• On a construction of Thomassen (Q1087884) (← links)
• Flows and generalized coloring theorems in graphs (Q1133552) (← links)
• Construction of class two graphs with maximum vertex degree three (Q1147159) (← links)
• Even polyhedral decompositions of cubic graphs (Q1149455) (← links)
• Note sur la non existence d'un snark d'ordre 16 (Q1157340) (← links)
• Smallest maximally nonhamiltonian graphs (Q1166539) (← links)
• Snarks of order 18 (Q1168330) (← links)
• Smallest maximally nonhamiltonian graphs. II (Q1199118) (← links)
• Geometric coloring theory (Q1239165) (← links)
• An appreciation of Professor Rufus Isaacs (Q1252015) (← links)
• Colouring problems (Q1255499) (← links)
• Triangle-free circuit decompositions and Petersen minor (Q1272477) (← links)
• Computer based proofs by induction in graph theory - A house of cards? (Q1310223) (← links)
• A cyclically 6-edge-connected snark of order 118 (Q1356433) (← links)
• Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs (Q1356437) (← links)
• The construction and reduction of strong snarks (Q1356495) (← links)
• Tutte's edge-colouring conjecture (Q1369658) (← links)
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. (Q1425113) (← links)
• Classification and characterizations of snarks (Q1584327) (← links)
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows (Q1612758) (← links)
• Oddness to resistance ratios in cubic graphs (Q1625797) (← links)
• A note on using the resistance-distance matrix to solve Hamiltonian cycle problem (Q1708538) (← links)