The Number of Polyhedral (3-Connected Planar) Graphs

Mathematics of Computation - United States
doi 10.2307/2007444
Full Text
Abstract

Available in full text

Date
Authors
Publisher

JSTOR

Related search

The Number of Polyhedral (3-Connected Planar) Graphs

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1996English

Doubly Connected Geodetic Number of Graphs

Malaya Journal of Matematik
2018English

Infinite Highly Connected Planar Graphs of Large Girth

Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
Mathematics
2006English

On Domination Critical Graphs With Cutvertices Having Connected Domination Number 3

International Mathematical Forum
2007English

Constant Memory Routing in Quasi-Planar and Quasi-Polyhedral Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

The Number of Labeled Connected Graphs Modulo Prime Powers

SIAM Journal on Discrete Mathematics
Mathematics
2016English

Chromatic Number of Sparse Colored Mixed Planar Graphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Contractible Subgraphs in 3-Connected Graphs

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy