Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
From MaRDI portal
Publication:2552510
DOI10.1016/S0095-8956(73)80006-1zbMath0237.05106WikidataQ29302353 ScholiaQ29302353MaRDI QIDQ2552510
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items (34)
Bipartite regular graphs and shortness parameters ⋮ Circuits through prescribed vertices in k‐connected k‐regular graphs ⋮ Spanning trees and spanning closed walks with small degrees ⋮ Regular Graphs with Few Longest Cycles ⋮ r-Regular, r-connected decompositions of complete graphs ⋮ Fractional matchings, component-factors and edge-chromatic critical graphs ⋮ Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs ⋮ Circular flow numbers of regular multigraphs ⋮ Highly edge‐connected regular graphs without large factorizable subgraphs ⋮ Edge colorings and circular flows on regular graphs ⋮ On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks ⋮ 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles ⋮ Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs ⋮ Edge-disjoint Hamilton cycles in 4-regular planar graphs ⋮ A nine point theorem for 3-connected graphs ⋮ Longest cycles in r-regular r-connected graphs ⋮ Snarks and flow-snarks constructed from coloring-snarks. ⋮ Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs ⋮ Cyclability of r-regular r-connected graphs ⋮ Symmetric ILP: Coloring and small integers ⋮ The covering radius of the cycle code of a graph ⋮ Pairs of Hamiltonian circuits in 5-connected planar graphs ⋮ Connected (g, f)-factors ⋮ Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes ⋮ Pairs of edge-disjoint Hamiltonian circuits ⋮ Factorizing regular graphs ⋮ Approximating Vizing's independence number conjecture ⋮ Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs ⋮ On r-regular r-connected non-hamiltonian graphs ⋮ Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs ⋮ A look at cycles containing specified elements of a graph ⋮ Are all simple 4-polytopes Hamiltonian? ⋮ On minimally \((n,\lambda)\)-connected graphs ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees
Cites Work
This page was built for publication: Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
