Publication:3230887
From MaRDI portal
zbMath0068.37202MaRDI QIDQ3230887
Publication date: 1955
Full work available at URL: http://dml.cz/handle/10338.dmlcz/108220
05Cxx: Graph theory
Related Items
Extremal problems for chromatic neighborhood sets, Unnamed Item, Unnamed Item, Every planar graph with nine points has a nonplanar complement, The polytope of degree sequences, A family of switch equivalent graphs, Conditions for sequences to be r-graphic, On the least size of a graph with a given degree set, Nontraceable detour graphs, A short proof of a theorem on degree sets of graphs, A short constructive proof of the Erdős-Gallai characterization of graphic lists, Graphic sequences with a realization containing a union of cliques, Graphic sequences with a realization containing a generalized friendship graph, Degree sequence and supereulerian graphs, A simple criterion on degree sequences of graphs, A remark on degree sequences of multigraphs, Linear-time certifying algorithms for near-graphical sequences, The convex hull of degree sequences of signed graphs, Graphic sequences with unique realization, Eccentric sequences and eccentric sets in graphs, Construction of Hamiltonian graphs and bigraphs with prescribed degrees, Independence and the Havel-Hakimi residue, Degree sequences and majorization, Realizability and uniqueness in graphs, An algorithm to generate tournament score sequences, A lower bound on the independence number of a graph, A note on a theorem of Erdős and Gallai, On existence of hypergraphs with prescribed edge degree profile, Pruning the search tree in the constructive enumeration of molecular graphs, Rounding in symmetric matrices and undirected graphs, Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence, Sufficient degree conditions fork-edge-connectedness of a graph, Uniform Sampling of Digraphs with a Fixed Degree Sequence, Unnamed Item, Degree Sequences in Complexes and Hypergraphs
