The following pages link to Maciej M. Sysło (Q583878):
Displayed 50 items.
- In-trees and plane embeddings of outerplanar graphs (Q583880) (← links)
- (Q751505) (redirect page) (← links)
- (Q786828) (redirect page) (← links)
- An algorithm to recognize a middle graph (Q786829) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Optimal constructions of reversible digraphs (Q801802) (← links)
- The subgraph isomorphism problem for outerplanar graphs (Q1056237) (← links)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887) (← links)
- Interior graphs of maximal outerplane graphs (Q1059083) (← links)
- (Q1061145) (redirect page) (← links)
- Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three (Q1061146) (← links)
- Triangulated edge intersection graphs of paths in a tree (Q1061147) (← links)
- The theorem on planar graphs (Q1071005) (← links)
- Enumeration of articulation pairs of a planar graph (Q1071024) (← links)
- On negative cycles in mixed graphs (Q1071027) (← links)
- Chordal bipartite graphs and crowns (Q1071029) (← links)
- A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
- A fully distributed (minimal) spanning tree algorithm (Q1087548) (← links)
- On reorienting graphs by pushing down maximal vertices (Q1087553) (← links)
- A general backtrack algorithm for the isomorphism problem of combinatorial objects (Q1087556) (← links)
- Some applications of graph theory to the study of polymer configuration (Q1095951) (← links)
- Finding a homotopy base for directed paths in an acyclic graph (Q1099184) (← links)
- Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations (Q1100219) (← links)
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949) (← links)
- An algorithm for solving the jump number problem (Q1113927) (← links)
- Reducing prime graphs and recognizing circle graphs (Q1116953) (← links)
- Sequential coloring versus Welsh-Powell bound (Q1121275) (← links)
- The helly-type property of non-trivial intervals on a tree (Q1160186) (← links)
- A labeling algorithm to recognize a line digraph and output its root graph (Q1163377) (← links)
- Dominating cycles in Halin graphs (Q1174137) (← links)
- Some properties of graph centroids (Q1179740) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- (Q1229719) (redirect page) (← links)
- Computational experiences with some transitive closure algorithms (Q1229720) (← links)
- Characterizations of outerplanar graphs (Q1255015) (← links)
- Polyhedral consequences of the amalgam operation (Q1331977) (← links)
- Maximal outerplanar graphs with perfect face-independent vertex covers (Q1336632) (← links)
- Bandwidth and density for block graphs (Q1584358) (← links)
- On some new types of greedy chains and greedy linear extensions of partially ordered sets (Q1894377) (← links)
- The jump number problem on interval orders: A 3/2 approximation algorithm (Q1898347) (← links)
- Hamiltonicity of amalgams (Q1961758) (← links)
- (Q3039069) (← links)
- (Q3041213) (← links)
- (Q3198869) (← links)
- On Hallian digraphs, permanents and transversals (Q3208660) (← links)
- On cycle bases of a graph (Q3208700) (← links)
- Series - parallel graphs and depth-first search trees (Q3219788) (← links)
- (Q3310645) (← links)
- (Q3322145) (← links)