A Theorem on Connected Graphs in Which Every Edge Belongs to a 1-Factor

Journal of the Australian Mathematical Society
doi 10.1017/s144678870002913x
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

A Uniqueness Theorem for Edge-Chromatic Graphs

Pacific Journal of Mathematics
Mathematics
1967English

Generating Connected and 2-Edge Connected Graphs

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2009English

On 3-Total Edge Product Cordial Connected Graphs

Opuscula Mathematica
Mathematics
2017English

Modeling of a Point Set Which Belongs to a Spatial Monotone Curve

APPLIED GEOMETRY AND ENGINEERING GRAPHICS
2019English

Minimally Locally 1-Connected Graphs

Bulletin of the Australian Mathematical Society
Mathematics
1978English

Existence of K-Edge Connected Ordinary Graphs With Prescribed Degrees

Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
1964English

Planes in Which Every Quadrangle Lies on a Unique Baer Subplane

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2011English

A Separator Theorem for Chordal Graphs

SIAM Journal on Algebraic Discrete Methods
1984English

Conditions Under Which a Connected Representable Space Is Locally Connected

Pacific Journal of Mathematics
Mathematics
1974English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy