scientific article; zbMATH DE number 3625415

Gary Chartrand, Linda Lesniak, Mehdi Behzad

Publication date: 1979

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 (only showing first 100 items - show all)

On the first-order edge tenacity of a graph ⋮ Uniquely cocolourable graphs ⋮ The ith Ramsey number for matchings ⋮ Clique graphs of packed graphs ⋮ 1/2-transitive graphs of order \(3p\) ⋮ Contractible edges in 3-connected graphs ⋮ Connected graphs containing a given connected graph as a unique greatest common subgraph ⋮ Covering projections of graphs preserving links of vertices and edges ⋮ Multiterminal duality and three-terminal series-parallelness ⋮ Ramsey numbers for unions of some cycles ⋮ Packing trees in complete graphs ⋮ Almost self-complementary factors of complete bipartite graphs ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ A note on extended stable sets ⋮ Spanning trees with pairwise nonadjacent endvertices ⋮ Scattering number and extremal non-Hamiltonian graphs ⋮ The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials ⋮ Extremal theory and bipartite graph-tree Ramsey numbers ⋮ INGRID: A graph invariant manipulator ⋮ Deadlock free buffer allocation in closed queueing networks ⋮ Score sequences: Lexicographic enumeration and tournament construction ⋮ On natural isomorphisms of cycle permutation graphs ⋮ A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs ⋮ On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph ⋮ An approximation algorithm for the TSP ⋮ Products of graphs with their closed-set lattices ⋮ Uniquely total colorable graphs ⋮ Transitivity of fuzzy matrices under generalized connectedness ⋮ Factors and induced subgraphs ⋮ Extending cycles in bipartite graphs ⋮ On the thickness and arboricity of a graph ⋮ Neighbourhood unions and Hamiltonian properties in graphs ⋮ A grammatical characterization of alternating pushdown automata ⋮ The multiplicity of 1-factors in total graphs ⋮ A note on locally connected and Hamiltonian-connected graphs ⋮ Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles ⋮ The cochromatic index of a graph ⋮ Edge cosymmetric graphs ⋮ Ramsey-minimal graphs for star-forests ⋮ Markov loops, free field and Eulerian networks ⋮ Ranking by outdegree for directed graphs ⋮ Graphs with certain families of spanning trees ⋮ Enumeration of packed graphs ⋮ Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances ⋮ Displacement operator based decompositions of matrices using circulants or other group matrices ⋮ A simple proof of a theorem of Jung ⋮ Whitney numbers of the second kind for the star poset ⋮ A minimum length covering subgraph of a network ⋮ Ramsey-minimal graphs for forests ⋮ On the order of uniquely (k,m)-colourable graphs ⋮ On the structure of random unlabelled acyclic graphs. ⋮ Forbidden subgraphs and Hamiltonian properties and graphs ⋮ Extremal regular graphs for the achromatic number ⋮ R-domination of block 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 ⋮ On the solution of \(w\)-stable sets ⋮ Reconstruction of infinite graphs ⋮ On the divisibility of the cycle number by 7 ⋮ The bounded chromatic number for graphs of genus \(g\) ⋮ A minimum 3-connectivity augmentation of a graph ⋮ Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\) ⋮ On the factor-thickness of regular graphs ⋮ Long cycles through specified vertices in a graph ⋮ Locating an absolute center on graphs that are almost trees ⋮ Long cycles in graphs with large degree sums ⋮ Extending cycles in graphs ⋮ Bidirectional retracting-free double tracings and upper embeddability of graphs ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle ⋮ Packing sequences ⋮ Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs ⋮ Proof of a conjecture of Haeggkvist on cycles and independent edges ⋮ Cohesion and stability in graphs ⋮ Regular graphs and edge chromatic number ⋮ Maximum graphs with a unique k-factor ⋮ Maximum non-path-connected graphs ⋮ Bounds on graph spectra ⋮ A note on the complexity of finding regular subgraphs ⋮ Upper bounds on the edge clique cover number of a graph ⋮ On the length of longest dominating cycles in graphs ⋮ Modeling uncertainty in networks ⋮ Reverse binary graphs ⋮ On cycle permutation graphs ⋮ The search for chromatically unique graphs ⋮ Sufficient conditions for a graph to have factors ⋮ On a construction of critical graphs which are not sensitive ⋮ Fuzzy shortest paths ⋮ Path extendable graphs ⋮ Randomly n-cyclic digraphs ⋮ Eccentric graphs ⋮ Homogeneously representable interval graphs ⋮ Degree sets of degree uniform graphs ⋮ Graphs with unique maximum independent sets ⋮ Generalized complementation ⋮ Factors of regular graphs

This page was built for publication: