Three‐regular subgraphs of four‐regular graphs
From MaRDI portal
Publication:5904287
DOI10.1002/jgt.3190030408zbMath0427.05055OpenAlexW2162545545MaRDI QIDQ5904287
Carsten Thomassen, Herbert Fleischner, John Sheehan, Václav Chvátal
Publication date: 1979
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190030408
Related Items (12)
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Regular subgraphs of almost regular graphs ⋮ Tight complexity bounds for FPT subgraph problems parameterized by the clique-width ⋮ Parameterized complexity of finding small degree-constrained subgraphs ⋮ Editing graphs to satisfy degree constraints: a parameterized approach ⋮ The complexity of regular subgraph recognition ⋮ Polynomial time algorithms for two classes of subgraph problem ⋮ Three-regular parts of four-regular graphs ⋮ Parameterized Graph Editing with Chosen Vertex Degrees ⋮ A note on the complexity of finding regular subgraphs ⋮ 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
Cites Work
This page was built for publication: Three‐regular subgraphs of four‐regular graphs
