scientific article; zbMATH DE number 3377257
From MaRDI portal
Publication:5648381
zbMath0238.05101MaRDI QIDQ5648381
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items (56)
Unnamed Item ⋮ Critical star multigraphs ⋮ On Invariants of Graphs with Applications to Knot Theory ⋮ Eigenvectors of acyclic matrices ⋮ A new class of enumeration problems ⋮ Unnamed Item ⋮ Unique list colorability of the graph Кn2 + Kr ⋮ Unnamed Item ⋮ Embedding of sign-regular signed graphs and its spectral analysis ⋮ Unnamed Item ⋮ On the degree of parallelism in membrane systems ⋮ Transitive Graphs With Fewer Than Twenty Vertices ⋮ A generalization of Hamiltonian cycles for trees ⋮ Infinite subgraphs as matroid circuits ⋮ A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies ⋮ On determining the 4-rank of the ideal class group of a quadratic field ⋮ On pancyclic line graphs ⋮ An upper bound for the minimum degree of a graph ⋮ Unnamed Item ⋮ Matchings in infinite graphs ⋮ On eulerian subgraphs of complementary graphs ⋮ A Characterization of Total Graphs ⋮ Sabidussi-type theorems for stability ⋮ Unnamed Item ⋮ On the existence of 1-factors in partial squares of graphs ⋮ Local approximation of Markov chains in time and space ⋮ The tree-covering number of a graph ⋮ The diameter and radius of simple graphs ⋮ On the automorphism group of a tree ⋮ Counting rooted maps by genus. III: Nonseparable maps ⋮ A note on applying a theorem of Tutte to graphical sequences ⋮ Embedding graphs in their complements ⋮ On n-hamiltonian line graphs ⋮ Generalized Ramsey theory for multiple colors ⋮ The size Ramsey number ⋮ On metric properties of certain clique graphs ⋮ Panconnected graphs. II ⋮ A new graph product and its spectrum ⋮ Eccentric sequences in graphs ⋮ Disjoint cliques in regular graphs of degree seven and eight ⋮ A recursive construction of asymmetric 1-factorizations ⋮ Hamiltonian cycles in regular graphs of moderate degree ⋮ The completion of a classification for maximal nonhamiltonian Burkard-Hammer graphs ⋮ Minimally locally 1-connected graphs ⋮ k-Blocks and Ultrablocks in Graphs ⋮ The edge nucleus of a point-determining graph ⋮ A note on 1-factors in graphs ⋮ Maximal Hamiltonian cycles in squares of graphs ⋮ Solution of the Hamiltonian problem for self-complementary graphs ⋮ On the classification problem for tetravalent metacirculant graphs ⋮ Unnamed Item ⋮ A necessary condition for maximal nonhamiltonian Burkard-Hammer graphs ⋮ Characterization of n-path graphs and of graphs having \(n\)-th root ⋮ Colorings of the Graph K ᵐ 2 + Kn ⋮ Unnamed Item ⋮ A theorem on connected graphs in which every edge belongs to a 1-factor
This page was built for publication:
