3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
From MaRDI portal
Publication:5264756
DOI10.1134/S1990478914040024zbMath1324.05054MaRDI QIDQ5264756
Publication date: 27 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- [a,b-factors of graphs]
- Regular subgraphs of almost regular graphs
- A simple existence criterion for \((g<f)\)-factors
- Three-regular parts of four-regular graphs
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Factors of regular graphs
- General factors of graphs
- General antifactors of graphs
- Degree constrained subgraphs
- A combinatorial problem on finite Abelian groups. II
- The Subgraph Problem
- Combinatorial Nullstellensatz
- Subgraphs with prescribed valencies
- Three‐regular subgraphs of four‐regular graphs
- Three-regular subgraphs of four-regular graphs
This page was built for publication: 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs