scientific article

No author found.

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

graph theory Graph theory Selected topics

Proceedings, conferences, collections, etc. pertaining to ordered structures (06-06) Graph theory (05Cxx) Conference proceedings and collections of articles (00Bxx)

Related Items (73)

Coloring of a non-zero component graph associated with a finite dimensional vector space ⋮ Determining the thickness of graphs is NP-hard ⋮ On the genus of the tensor product of graphs where one factor is a regular graph ⋮ On the nullity and the matching number of unicyclic graphs ⋮ Nonorientable genus of nearly complete bipartite graphs ⋮ Unnamed Item ⋮ N-free posets as generalizations of series-parallel posets ⋮ Grids and their minors ⋮ Algebraic Distance Graphs and Rigidity ⋮ A directed graph version of strongly regular graphs ⋮ A numbering of the vertices of special networks ⋮ Optimal parallel construction of prescribed tournaments ⋮ On the structure of compact graphs ⋮ Disjoint Hamiltonian cycles in fan 2k‐type graphs ⋮ On the line graphs of the complete \(r\)-partite graphs ⋮ The \(L(2,1)\)-labeling on planar graphs ⋮ Score sequences: Lexicographic enumeration and tournament construction ⋮ Metric Transforms and Euclidean Embeddings ⋮ The outerplanar crossing number of the complete bipartite graph ⋮ Finite planes and graphs ⋮ On the crossing numbers of Cartesian products with paths ⋮ The thickness of a minor-excluded class of graphs ⋮ Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs ⋮ Orientation embedding of signed graphs ⋮ Tight bounds for finding degrees from the adjacency matrix ⋮ An algorithm for imbedding cubic graphs in the torus ⋮ The complement of the intersection graph of ideals of a poset ⋮ Common kings of a chain of cycles in a strong tournament ⋮ Hadwiger's Conjecture for ℓ‐Link Graphs ⋮ Unique Fulkerson coloring of Petersen minor-free cubic graphs ⋮ Cheeger constants of Platonic graphs. ⋮ Strongly regular graphs and finite Ramsey theory ⋮ The crossing number of the Cartesian product of paths with complete graphs ⋮ Hamiltonian paths in vertex-symmetric graphs of order 5p ⋮ Singular distance powers of circuits ⋮ On tournament matrices ⋮ Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach ⋮ \(K_{1,3}\)-free and \(W_4\)-free graphs ⋮ On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\) ⋮ Line graph links ⋮ On Hadwiger's number---A problem of the Nordhaus-Gaddum type ⋮ On biclique partitions of the complete graph ⋮ Transforming eulerian trails ⋮ Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem ⋮ Note on the degree sequences of \(k\)-hypertournaments ⋮ Graph invariants and large cycles: a survey ⋮ Idempotence for sign-pattern matrices ⋮ Largest eigenvalue of a unicyclic mixed graphs ⋮ A modular approach to Sprouts ⋮ A hypocoloring model for batch scheduling ⋮ Paired-domination number of claw-free odd-regular graphs ⋮ A note on Halton's conjecture ⋮ The intersection graph of ideals of ℤm ⋮ Automorphism groups of Walecki tournaments with zero and odd signatures ⋮ The nil-graph of ideals of a commutative ring ⋮ On the crossing number of \(K_{ m } \square P_{n}\) ⋮ The crossing number of \(K_{2,m}\square P_n\) ⋮ Underlying simple graphs ⋮ Strongly edge triangle regular graphs and a conjecture of Kotzig ⋮ Unnamed Item ⋮ Inclusion relations of certain graph eigenspaces ⋮ About supergraphs. I ⋮ About supergraphs. II ⋮ Irreducible 2‐fold cycle systems ⋮ Upper bounds of the spectral radius of graphs in terms of genus ⋮ Unnamed Item ⋮ Hamilton paths and cycles in vertex-transitive graphs of order \(6p\) ⋮ A planarity criterion for cubic bipartite graphs ⋮ Lower bounds for the clique and the chromatic numbers of a graph ⋮ About supergraphs. III ⋮ Working with Lowell ⋮ Polynomial reconstruction and terminal vertices ⋮ On bipartite graphs having minimum fourth adjacency coefficient

This page was built for publication: