scientific article; zbMATH DE number 3657692
From MaRDI portal
Publication:3856672
Cited in
(80)- Inclusion relations of certain graph eigenspaces
- Hamilton paths and cycles in vertex-transitive graphs of order 6p
- Nonorientable genus of nearly complete bipartite graphs
- N-free posets as generalizations of series-parallel posets
- Grids and their minors
- A directed graph version of strongly regular graphs
- Score sequences: Lexicographic enumeration and tournament construction
- Finite planes and graphs
- An algorithm for imbedding cubic graphs in the torus
- Strongly regular graphs and finite Ramsey theory
- Hamiltonian paths in vertex-symmetric graphs of order 5p
- On tournament matrices
- On Hadwiger's number---A problem of the Nordhaus-Gaddum type
- Idempotence for sign-pattern matrices
- On the genus of the tensor product of graphs where one factor is a regular graph
- A numbering of the vertices of special networks
- On the line graphs of the complete r-partite graphs
- The thickness of a minor-excluded class of graphs
- Cheeger constants of Platonic graphs.
- Upper bounds of the spectral radius of graphs in terms of genus
- A planarity criterion for cubic bipartite graphs
- Largest eigenvalue of a unicyclic mixed graphs
- A modular approach to Sprouts
- A hypocoloring model for batch scheduling
- Strongly edge triangle regular graphs and a conjecture of Kotzig
- Polynomial reconstruction and terminal vertices
- Paired-domination number of claw-free odd-regular graphs
- On bipartite graphs having minimum fourth adjacency coefficient
- The outerplanar crossing number of the complete bipartite graph
- Line graph links
- Underlying simple graphs
- About supergraphs. I
- About supergraphs. II
- About supergraphs. III
- The crossing number of the Cartesian product of paths with complete graphs
- Note on the degree sequences of \(k\)-hypertournaments
- Optimal parallel construction of prescribed tournaments
- Hadwiger's conjecture for -link graphs
- scientific article; zbMATH DE number 7225866 (Why is no real title available?)
- Determining the thickness of graphs is NP-hard
- Orientation embedding of signed graphs
- scientific article; zbMATH DE number 97635 (Why is no real title available?)
- Disjoint Hamiltonian cycles in fan 2k‐type graphs
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
- On the structure of compact graphs
- Unique Fulkerson coloring of Petersen minor-free cubic graphs
- Algebraic Distance Graphs and Rigidity
- Metric Transforms and Euclidean Embeddings
- scientific article; zbMATH DE number 907922 (Why is no real title available?)
- Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach
- Working with Lowell
- Tight bounds for finding degrees from the adjacency matrix
- The intersection graph of ideals of Z_m
- Automorphism groups of Walecki tournaments with zero and odd signatures
- Coloring of a non-zero component graph associated with a finite dimensional vector space
- Graph invariants and large cycles: a survey
- Irreducible 2‐fold cycle systems
- Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem
- The complement of the intersection graph of ideals of a poset
- Common kings of a chain of cycles in a strong tournament
- An extension of the essential graph of a ring
- The chromatic polynomial of grid graph P₃ P_n
- A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
- \(K_{1,3}\)-free and \(W_4\)-free graphs
- On biclique partitions of the complete graph
- Transforming eulerian trails
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
- On the nullity of middle graphs
- A note on Halton's conjecture
- On the non-incident quasi-total graph and its complement
- New algorithms and lower bounds for streaming tournaments
- The nil-graph of ideals of a commutative ring
- Lower bounds for the clique and the chromatic numbers of a graph
- On the nullity and the matching number of unicyclic graphs
- The \(L(2,1)\)-labeling on planar graphs
- On the crossing numbers of Cartesian products with paths
- Singular distance powers of circuits
- On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
- On the crossing number of \(K_{ m } \square P_{n}\)
- The crossing number of \(K_{2,m}\square P_n\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856672)
