- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
A Mixed 4-partition Problem for 2-edge-connected Graphs
-
- WADA Koichi
- Nagoya Institute of Technology
-
- IWASE Atsuchi
- Nagoya Institute of Technology
-
- KAWAGUCHI Kimio
- Nagoya Institute of Technology
Bibliographic Information
- Other Title
-
- 2辺連結グラフの4分割について
Search this article
Description
We consider called a mixed k-partition problem without bases which partitions a k-edge-connected graph into k edge-disjoint connected subgraphs, each of which has a specified number of elements (vertices and edges). In addition to the conditions if one element called base can be contained in the specified subgraph, this is called a mixed k-partition problem with one base. In this paper, we show a class of 2-edge-connected graphs for which the mixed 4-partition problem with one base(or without bases) can be solved. We also show that there exist 2-edge-connected graphs outside the class for which we can not solve the mixed 4-partition problem with one base.
Journal
-
- IEICE technical report. Theoretical foundations of Computing
-
IEICE technical report. Theoretical foundations of Computing 95 (498), 39-48, 1996-01-26
The Institute of Electronics, Information and Communication Engineers
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1573105977190850432
-
- NII Article ID
- 110003191530
-
- NII Book ID
- AN10013152
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles
