scientific article; zbMATH DE number 7057483

zbMath1411.05148MaRDI QIDQ5377021

Kenta Ozeki, Shun-ichi Maezawa, Nastaran Haghparast, Mikio Kano

Publication date: 23 May 2019

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/73/ajc_v73_p200.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

4-edge-connected graph

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Edge-connectivity and edge-disjoint spanning trees
• On factors with all degrees odd
• Flows and generalized coloring theorems in graphs
• Connected factors in graphs -- a survey
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• Matching, Euler tours and the Chinese postman

This page was built for publication: