Skip to content
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Online Journal of Analytic Combinatorics
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Online Journal of Analytic Combinatorics
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Search
Contents
Abstract
References
Ars Combinatoria
Volume 061
Pages: 211-220
Research article
\(2\)-Reducible Paths Containing a Specified Edge in \((2k + 1)\)-Edge-Connected Graphs
Haruko Okamura
1
1
Department of Information Science and Systems Engineering Konan University, Okamoto Kobe 658-8501, Japan
Published: 31/10/2001
Download PDF
Cite
Copyright Link
License
Citation
Haruko Okamura. \(2\)-Reducible Paths Containing a Specified Edge in \((2k + 1)\)-Edge-Connected Graphs[J],
Ars Combinatoria
, Volume 061. 211-220. .
