scientific article; zbMATH DE number 970801
From MaRDI portal
Publication:5689006
zbMath0864.05075MaRDI QIDQ5689006
Michael Stiebitz, Herbert Fleischner
Publication date: 11 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decompositioncycle double cover conjectureHamiltonian cyclechromatic numberpolynomial algorithmcoloringstrongly \(k\)-colorable orientations
Paths and cycles (05C38) 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 (9)
An algorithm for identifying cycle-plus-triangles graphs ⋮ 3-colorability of 4-regular hamiltonian graphs ⋮ Eulerian colorings and the bipartizing matchings conjecture of Fleischner ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ On finding constrained independent sets in cycles ⋮ Partitioning into common independent sets via relaxing strongly base orderability ⋮ An asymptotic bound for the strong chromatic number ⋮ Flows, flow-pair covers and cycle double covers ⋮ The complexity of finding fair independent sets in cycles
This page was built for publication:
