A note on minimally 3-connected graphs

JOURNAL ARTICLE

Year: 2004 Journal: Discussiones Mathematicae Graph Theory Vol: 24 (1)Pages: 115-115 Publisher: De Gruyter Open

DOI: 10.7151/dmgt.1218

Abstract

If G is a minimally 3-connected graph and C is a double cover of the set of edges of G by irreducible walks, then |E(G)| ≥ 2|C| -2.

Keywords:

Mathematics Combinatorics Graph Cover (algebra) Set (abstract data type) Discrete mathematics Computer science

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.12

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics