Existence of k-edge connected ordinary graphs with prescribed degrees
From MaRDI portal
Publication:5732669
DOI10.6028/jres.068B.013zbMath0121.26002MaRDI QIDQ5732669
Publication date: 1964
Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items
Network synchronization: Spectral versus statistical properties, On the simultaneous edge coloring of graphs, Independence number of graphs and line graphs of trees by means of omega invariant, Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs, Forcibly bipartite and acyclic (uni-)graphic sequences, Characterization of Digraphic Sequences with Strongly Connected Realizations, Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem, Combined connectivity augmentation and orientation problems, On the existence of N‐connected graphs with prescribed degrees (n ≧ 2), Efficient counting of degree sequences, On the existence of super edge-connected graphs with prescribed degrees, Graph extensions, edit number and regular graphs, Construction of a Maximally Edge-Connected Graph with Prescribed Degrees, Sequences with a unique realization by simple graphs, Tough graphs and Hamiltonian circuits. (Reprint), Degree sequence and supereulerian graphs, Composed degree-distance realizations of graphs, Composed degree-distance realizations of graphs, Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs, Analyse und Synthese zuverlässiger Netze, Tough graphs and Hamiltonian circuits., Regular factors of simple regular graphs and factor-spectra, Bounds of the number of disjoint spanning trees, Some special realizations of partition matrix sequences, Connectedness criteria for graphs by means of omega invariant
