The following pages link to Ferdinand Gliviak (Q860608):
Displaying 50 items.
- (Q587974) (redirect page) (← links)
- \(D\)-bounded distance-regular graphs (Q674630) (← links)
- Antipodal graphs and digraphs (Q687870) (← links)
- Graphs and matrices with maximal energy (Q860609) (← links)
- Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences (Q870982) (← links)
- Packing non-zero \(A\)-paths in group-labelled graphs (Q879161) (← links)
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem (Q925137) (← links)
- Unicyclic graphs with given number of pendent vertices and minimal energy (Q996304) (← links)
- A degree sum condition concerning the connectivity and the independence number of a graph (Q1014827) (← links)
- Sufficient conditions for super-arc-strongly connected oriented graphs (Q1015435) (← links)
- Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes (Q1129812) (← links)
- The spectrum of de Bruijn and Kautz graphs (Q1266388) (← links)
- Packings of the complete directed graph with \(m\)-circuits (Q1288226) (← links)
- Superconnectivity of bipartite digraphs and graphs (Q1292813) (← links)
- A 1-\((S,T)\)-edge-connectivity augmentation algorithm (Q1300058) (← links)
- Directed vertex-connectivity augmentation (Q1300059) (← links)
- The superconnectivity of large digraphs and graphs (Q1313826) (← links)
- Infinite highly arc transitive digraphs and universal covering digraphs (Q1316644) (← links)
- Extraconnectivity of graphs with large girth (Q1322225) (← links)
- On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)
- Steiner distance stable graphs (Q1336650) (← links)
- Orientations of Hamiltonian cycles in bipartite digraphs (Q1337013) (← links)
- A few applications of negative-type inequalities (Q1340125) (← links)
- About a conjecture on the centers of chordal graphs (Q1340128) (← links)
- Connectivity and fault-tolerance of hyperdigraphs (Q1348372) (← links)
- Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph (Q1348657) (← links)
- A lower bound for the connectivity of directed Euler tour transformation graphs (Q1356528) (← links)
- On regular Terwilliger graphs with \(\mu=2\) (Q1358000) (← links)
- Some generalizations of Menger's theorem concerning arc-connected digraphs (Q1377773) (← links)
- Distance in digraphs (Q1388969) (← links)
- Using a progressive withdrawal procedure to study superconnectivity in digraphs (Q1394825) (← links)
- Kernels in pretransitive digraphs. (Q1420591) (← links)
- On the planarity of jump graphs (Q1567614) (← links)
- Decomposing hypergraphs into simple hypertrees (Q1586356) (← links)
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
- Finding all the negative cycles in a directed graph (Q1602697) (← links)
- The Chvátal-Erdős condition for panconnectivity of triangle-free graphs (Q1613497) (← links)
- The bandwidth sum of join and composition of graphs (Q1772413) (← links)
- Changing and unchanging of the radius of a graph (Q1805308) (← links)
- On strong distances in oriented graphs (Q1810644) (← links)
- Every cubic cage is quasi 4-connected (Q1810654) (← links)
- The decay number and the maximum genus of diameter 2 graphs (Q1841903) (← links)
- Diameter of the NEPS of bipartite graphs (Q1841924) (← links)
- 2-connected and 2-edge-connected Steinhaus graphs (Q1849930) (← links)
- On connectivity of consecutive-\(d\) digraphs (Q1850019) (← links)
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences (Q1861273) (← links)
- Digraphs and inclusion intervals of Brualdi-type for singular values (Q1862822) (← links)
- The generalized S-graphs of diameter 3 (Q1893167) (← links)
- The structure of the centroid in a Ptolemaic graph (Q1893686) (← links)
- Two new sufficient conditions for Hamilton-connected graphs (Q1898892) (← links)
