The 3-Connected Graphs With Exactly Three Non-Essential Edges

Graphs and Combinatorics - Japan
doi 10.1007/s00373-004-0552-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Nature

Related search

Small Graphs With Exactly Two Non-Negative Eigenvalues

Algebraic Structures and their Applications
Applied MathematicsNumber TheoryAlgebra
2017English

Triangulations of 3–Manifolds With Essential Edges

Annales de la faculté des sciences de Toulouse Mathématiques
2015English

Non-Isolated Resolving Number of Graphs With Homogeneous Pendant Edges

2018English

Contractible Subgraphs in 3-Connected Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

The Number of Polyhedral (3-Connected Planar) Graphs

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1996English

The Number of Polyhedral (3-Connected Planar) Graphs

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1981English

On 3-Total Edge Product Cordial Connected Graphs

Opuscula Mathematica
Mathematics
2017English

Connected Graphs With Distinct Eigenvalues

Advances in Applied Mathematics
2016English

On Domination Critical Graphs With Cutvertices Having Connected Domination Number 3

International Mathematical Forum
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy