Publication:4187840
From MaRDI portal
zbMath0403.05027MaRDI QIDQ4187840
Gary Chartrand, Linda Lesniak, Mehdi Behzad
Publication date: 1979
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05Cxx: Graph theory
Related Items
Unnamed Item, An axiomatic approach to metric properties of connected graphs, An algebraic characterization of geodetic graphs, Unnamed Item, Unnamed Item, Unnamed Item, Global stability of complex balanced mechanisms, On the divisibility of the cycle number by 7, A note on locally connected and Hamiltonian-connected graphs, A sufficient condition for a graph to have \([a,b\)-factors], The bondage number of a graph, Domatically critical and domatically full graphs, \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems, On the chromatic uniqueness of certain bipartite graphs, A structure theorem for some matrix algebras, Reconstruction of infinite graphs, The bounded chromatic number for graphs of genus \(g\), A minimum 3-connectivity augmentation of a graph, On the length of longest dominating cycles in graphs, Modeling uncertainty in networks, Reverse binary graphs, 1/2-transitive graphs of order \(3p\), Covering projections of graphs preserving links of vertices and edges, Almost self-complementary factors of complete bipartite graphs, Alternating cycles and paths in edge-coloured multigraphs: A survey, Spanning trees with pairwise nonadjacent endvertices, The search for chromatically unique graphs. II, A bibliography on chromatic polynomials, Uniquely total colorable graphs, Ranking by outdegree for directed graphs, On the structure of random unlabelled acyclic graphs., Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs, Closure systems and their structure, On the approximability of the maximum induced matching problem, Constructions of sensitive graphs which are not strongly sensitive, Spanning trees fixed by automorphisms of a graph, On the intersection graph of random caps on a sphere, Computers and discovery in algebraic graph theory, On a condition for the union of spherical caps to be connected, Extension of de Bruijn graph and Kautz graph, Star arboricity of graphs, Optimal control of multiclass parallel service systems, Decomposition of some planar graphs into trees, A remark on the connectivity of the complement of a 3-connected graph, On the lower length of the closed-set lattice of a tree, An improved upper bound for the TSP in cubic 3-edge-connected graphs, Tabular graphs and chromatic sum, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item
