Graph theory

DOI10.1007/BF01085015zbMath0287.05101MaRDI QIDQ5917392

V. P. Kozyrev

Publication date: 1974

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

Mathematics Subject Classification ID

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05Cxx: Graph theory

Cites Work

• On rigid circuit graphs
• Hamilton connected graphs
• Ein Sechsfarbenproblem auf der Kugel
• Das Geschlecht des vollständigen paaren Graphen
• Generating oriented graphs by means of team comparisons
• On the coloring of signed graphs
• Existence and structure of self-adjoint graphs
• On the linegraph of a directed-graph
• Homomorphiesätze für Graphen
• Maximum internally stable sets of a graph
• The connectivity of line-graphs
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• An extremal problem in graph theory
• Diagonalen im regulären n-Eck
• A generalization of hamiltonian-connected graphs
• Lösung des Problems der Nachbargebiete
• Infinite self-interchange graphs
• Intersection representations of graphs by arcs
• Beweis einer Abschwächung der Hadwiger-Vermutung
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Randomly traversable graphs
• On the power sequence of a graph
• Colouring the edges of a multigraph
• Unendliche minimale \(n\)-fach zusammenhängende Graphen
• \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
• On polynomials and crossing numbers of complete graphs
• The analogue of Eberhard's theorem for 4-valent graphs on the torus
• Graphs with forbidden subgraphs
• On Hamilton-cycles of random graphs
• Grötzsch's theorem on 3-colorings
• A Theorem on Planar Graphs
• A Characterization of Block-Graphs
• The Genus of the n-Cube
• The Maximum Number of Strongly Connected Subtournaments^*
• On a Problem of Schütte and Erdös
• On Eulerian and Hamiltonian Graphs and Line Graphs
• The Representation of a Graph by Set Intersections
• On Sets of Consistent Arcs in a Tournament
• The Eigenvalues of a Graph and Its Chromatic Number
• On a Problem of C. E. Shannon in Graph Theory
• Total Graphs and Traversability
• On the Non-Existence of a Type of Regular Graphs of Girth 5
• An upper bound for Ramsey numbers
• Characterization of line graphs
• A coarseness conjecture of Erdös
• On basis diagraphs
• On chromatic number of graphs and set-systems
• Die dicke des n-dimensionalen Würfel-graphen
• Fastplättbare Graphen
• Directed Graph Realization of Degree Pairs
• Minimally 2-connected graphs.
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• A geometric characterization of the line graph of a projective plane
• A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
• On the Planar Decomposition of a Complete Bipartite Graph
• On some extremal graphs
• On chromatic number of finite set-systems
• An Infinite Class of Hypohamiltonian Graphs
• The Coarseness of the Complete Graph
• On the Cube of a Graph
• Structure of Regular Total Graphs†
• On a theorem of Nordhaus and Gaddum
• On Detours in Graphs¹
• On Critical Graphs of Diameter 2
• On Minimal graphs of maximum even girth
• Über das Problem der Existenz von HAMILTONkreisen in planaren, regulären Graphen
• A Note on the Diameter of a Graph
• An inequality for the chromatic number of a graph
• A theorem on n-connected graphs
• An introduction to chromatic polynomials
• Undirected Graphs Realizable as Graphs of Modular Lattices
• The cube of every connected graph is 1-hamiltonian
• A sufficient condition for n ‐connectedness of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniquely colorable graphs
• On uniquely colorable planar graphs
• The toroidal crossing number of Km,n
• A note on the tree realizability of a distance matrix
• Sur les Ensembles de Sommets Indépendants Dans les Graphes Chromatiques Minimaux
• A note on K-path hamiltonian graphs
• Bounds for the chromatic number of a graph
• On a problem of P. Erdös
• On Sets of Arcs Containing No Cycles in a Tournament*
• An Analogue to the Heawood Map-Colouring Problem
• An Algorithm for Vertex-pair Connectivity
• Planar maps with prescribed types of vertices and faces
• On the Point-Arboricity of a Graph and its Complement
• The achromatic number of a graph
• A non-existence theorem for (v, k,λ)-graphs
• Minimally strong digraphs
• Connectivity in Products of Graphs
• Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes
• Zum basisproblem der nicht in die projektive ebene einbettbaren graphen, I
• Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.
• A Survey of Progress in Graph Theory in the Soviet Union
• Characterizing circular-arc graphs
• Disproof of a conjecture of Erdös and moser on tournaments
• Construction of strongly regular graphs using affine designs
• Regular d-valent graphs of girth 6 and 2(d2−d+1) vertices
• Cycles and Connectivity in Graphs
• Symmetric embeddings of graphs
• The crossing number of K5,n
• Tournaments That Admit Exactly One Hamiltonian Circuit
• On chromatic polynomials and the golden ratio
• A Note on Undirected Graphs Realizable as P.O. Sets
• Uniquely Partially Orderable Graphs
• Complementary Graphs and Edge Chromatic Numbers
• Toroidal maps with prescribed types of vertices and faces
• On Total Chromatic Number of a Graph
• ON EIGENVALUES AND COLORINGS OF GRAPHS, II
• On the Maximal Number of Edges in Graphs with a Given Number of Edge-Disjoint Triangles
• GRAPHS EDGE‐CRITICAL WITH RESPECT TO INDEPENDENCE NUMBER†
• A Characterization of Comparability Graphs and of Interval Graphs