Journal of Combinatorial Theory. Series B, volume 97, issue 3, pages 358-370
A constructive characterization of 3-connected triangle-free graphs
Publication type: Journal Article
Publication date: 2007-05-01
Q1
Q1
SJR: 1.793
CiteScore: 2.7
Impact factor: 1.2
ISSN: 00958956, 10960902
Computational Theory and Mathematics
Theoretical Computer Science
Discrete Mathematics and Combinatorics
Abstract
We present a method to construct the class C of finite simple 3-connected triangle-free graphs from the 3-regular complete bipartite graph K 3 , 3 and the skeleton of a 3-dimensional cube by sequentially applying one of five operations without leaving C in the intermediate steps. Each of these operations can be considered as a sequence of at most six vertex splittings and edge additions.
Found
Found
Top-30
Journals
|
1
|
|
|
Advances in Applied Mathematics
1 publication, 20%
|
|
|
European Journal of Combinatorics
1 publication, 20%
|
|
|
Springer Proceedings in Mathematics and Statistics
1 publication, 20%
|
|
|
Journal of Graph Theory
1 publication, 20%
|
|
|
1
|
Publishers
|
1
2
|
|
|
Elsevier
2 publications, 40%
|
|
|
Springer Nature
1 publication, 20%
|
|
|
Wiley
1 publication, 20%
|
|
|
Institute of Electrical and Electronics Engineers (IEEE)
1 publication, 20%
|
|
|
1
2
|
- We do not take into account publications without a DOI.
- Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
Cite this
GOST |
RIS |
BibTex |
MLA
Cite this
GOST
Copy
Kriesell M. A constructive characterization of 3-connected triangle-free graphs // Journal of Combinatorial Theory. Series B. 2007. Vol. 97. No. 3. pp. 358-370.
GOST all authors (up to 50)
Copy
Kriesell M. A constructive characterization of 3-connected triangle-free graphs // Journal of Combinatorial Theory. Series B. 2007. Vol. 97. No. 3. pp. 358-370.
Cite this
RIS
Copy
TY - JOUR
DO - 10.1016/j.jctb.2006.06.002
UR - https://doi.org/10.1016/j.jctb.2006.06.002
TI - A constructive characterization of 3-connected triangle-free graphs
T2 - Journal of Combinatorial Theory. Series B
AU - Kriesell, Matthias
PY - 2007
DA - 2007/05/01
PB - Elsevier
SP - 358-370
IS - 3
VL - 97
SN - 0095-8956
SN - 1096-0902
ER -
Cite this
BibTex (up to 50 authors)
Copy
@article{2007_Kriesell,
author = {Matthias Kriesell},
title = {A constructive characterization of 3-connected triangle-free graphs},
journal = {Journal of Combinatorial Theory. Series B},
year = {2007},
volume = {97},
publisher = {Elsevier},
month = {may},
url = {https://doi.org/10.1016/j.jctb.2006.06.002},
number = {3},
pages = {358--370},
doi = {10.1016/j.jctb.2006.06.002}
}
Cite this
MLA
Copy
Kriesell, Matthias. “A constructive characterization of 3-connected triangle-free graphs.” Journal of Combinatorial Theory. Series B, vol. 97, no. 3, May. 2007, pp. 358-370. https://doi.org/10.1016/j.jctb.2006.06.002.