Congruent graphs and the connectivity of graphs

DOI10.2307/2371086zbMATH Open58.0609.01OpenAlexW4231597948WikidataQ55872301 ScholiaQ55872301MaRDI QIDQ567002FDOQ567002

Authors: Hassler Whitney 

Publication date: 1932

Published in: American Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2371086

Cited In (14)

• On the minimum size of graphs with given generalized connectivity
• Characterising \(3\)-polytopes of radius one with unique realisation
• The 4-set tree connectivity of hierarchical folded hypercube
• A note on the general sum-connectivity index of a graph and its line graph
• On a property of 2-connected graphs and Dirac's theorem
• Title not available (Why is that?)
• Reliability analysis of exchanged hypercubes based on the path connectivity
• The proper 2-connection number of several graph classes
• On the matching arrangement of a graph and properties of its characteristic polynomial
• On the edge-chromatic number of 2-complexes
• The generalized 4-connectivity of burnt pancake graphs
• Large matchings in maximal 1-planar graphs
• Counting circuit double covers
• Exact results on generalized Erdős-Gallai problems

This page was built for publication: Congruent graphs and the connectivity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q567002)