The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- Extremal graphs domination insensitive to the removal of \(k\) edges (Q686272) (← links)
- The decomposition of graphs into \(k\)-connected components (Q686294) (← links)
- Classes of chromatically unique graphs (Q686445) (← links)
- 2-colourings in \(S(t, t+1, v)\) (Q686474) (← links)
- A shifting algorithm for constrained min-max partition on trees (Q686520) (← links)
- One factors and the existence of affine designs (Q687101) (← links)
- The coordinate representation of a graph and \(n\)-universal graph of radius 1 (Q687112) (← links)
- No-hole \((r+1)\)-distant colorings (Q688267) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Combinatorial approach for computing the characteristic polynomial of a matrix (Q710864) (← links)
- Fundamental group and cycle space of dual graphs and applications (Q711286) (← links)
- Outer-embeddability in certain pseudosurfaces arising from three spheres (Q712264) (← links)
- On real number labelings and graph invertibility (Q713307) (← links)
- On a construction using commuting regular graphs (Q729791) (← links)
- Inverses of \(q\)-distance matrices of a tree (Q732087) (← links)
- Subgraphs of minimal degree \(k\) (Q750456) (← links)
- Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems) (Q750458) (← links)
- A note on set union with arbitrary deunions (Q751279) (← links)
- 2-symmetric crystallizations and 2-fold branched coverings of \(S^ 3\) (Q753197) (← links)
- On domination and independent domination numbers of a graph (Q754234) (← links)
- The mixed postman problem (Q754753) (← links)
- Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs (Q754894) (← links)
- Some howell designs of prime side (Q755590) (← links)
- On the relationship between the genus and the cardinality of the maximum matchings of a graph (Q755593) (← links)
- Subgraphs with triangular components (Q755595) (← links)
- Constructions of point-colour-symmetric graphs (Q755598) (← links)
- Counting trees in directed regular multigraphs (Q757413) (← links)
- Two families of graphs satisfying the cycle basis interpolation property (Q757419) (← links)
- On the 2-extendability of the generalized Petersen graphs (Q757430) (← links)
- Trees with structures (Q758940) (← links)
- Path traversability in planar graphs (Q759035) (← links)
- The macrodynamics of open systems and the variational principle of the local potential. II: Applications (Q760361) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences (Q765379) (← links)
- Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
- The chromatic index of graphs with large maximum degree (Q786820) (← links)
- An algorithm to recognize a middle graph (Q786829) (← links)
- A general program scheme for finding bridges (Q787676) (← links)
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) (← links)
- Transmission facility planning in telecommunications networks: A heuristic approach (Q788618) (← links)
- Counting and coding identity trees with fixed diameter and bounded degree (Q789398) (← links)
- A table of connected graphs on six vertices (Q789413) (← links)
- A note on stability of graphs (Q790126) (← links)
- Infinite families of crossing-critical graphs with a given crossing number (Q790825) (← links)
- Graphs uniquely Hamiltonian-connected from a vertex (Q790840) (← links)
- Graph equations for line graphs, total graphs, middle graphs and quasi- total graphs (Q791547) (← links)
- An extremal problem in geodetic graphs (Q792335) (← links)
- Reduction graphs in the lambda calculus (Q792994) (← links)
- A game of cops and robbers (Q793755) (← links)
