The following pages link to Heinz Joachim Presia (Q593309):
Displayed 50 items.
- Matching polynomials and duality (Q558244) (← links)
- Item:Q593309 (redirect page) (← links)
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- Orientations of graphs in kernel theory (Q809100) (← links)
- Hamiltonian degree conditions which imply a graph is pancyclic (Q912127) (← links)
- Zur Struktur der (\({\mathfrak P}^ 3\))-realisierbaren Graphen. (On the structure of (\({\mathfrak P}^ 3\)-realizable graphs)) (Q912133) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number (Q1092065) (← links)
- Balanced decompositions of a signed graph (Q1092068) (← links)
- Reverse class critical multigraphs (Q1101459) (← links)
- On the problem of how to represent a graph taking into account an additional structure (Q1101469) (← links)
- A sequential dual simplex algorithm for the linear assignment problem (Q1108928) (← links)
- Class one graphs (Q1112066) (← links)
- Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs (Q1179193) (← links)
- Two characterizations of generalized hypercube (Q1182875) (← links)
- Excluding infinite minors (Q1191928) (← links)
- The retracts of Hamming graphs (Q1193717) (← links)
- Some notes on cycle graphs (Q1199489) (← links)
- A characterization of bipartite graphs associated with BIB-designs with \(\lambda\)=1 (Q1210576) (← links)
- Representing triangulated graphs in stars (Q1261172) (← links)
- On packing connectors (Q1272488) (← links)
- Item:Q593309 (redirect page) (← links)
- Universal arrow-free graphs (Q1297747) (← links)
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian (Q1300907) (← links)
- Forbidden triples and traceability: A characterization (Q1301658) (← links)
- The super line graph \({\mathfrak L}_2\) (Q1304807) (← links)
- Queens graphs (Q1304808) (← links)
- Excluding a countable clique (Q1305523) (← links)
- A characterization of some graphs which do not contain 3-claws (Q1313824) (← links)
- How to find overfull subgraphs in graphs with large maximum degree (Q1329811) (← links)
- Linear recognition of pseudo-split graphs (Q1331889) (← links)
- Intersection graphs of concatenable subtrees of graphs (Q1331898) (← links)
- Absolute retracts of split graphs (Q1339865) (← links)
- Dominating subgraphs in graphs with some forbidden structures (Q1343259) (← links)
- On subgraphs of Cartesian product graphs (Q1349090) (← links)
- Towards a characterisation of Pfaffian near bipartite graphs (Q1349098) (← links)
- Letter graphs and well-quasi-order by induced subgraphs (Q1349106) (← links)
- Totally equimatchable graphs (Q1356717) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Clique neighborhoods and nearly chordal graphs (Q1363699) (← links)
- Characterization of the folded Johnson graphs of small diameter by their intersection arrays (Q1372622) (← links)
- The strongly perfectness of normal product of \(t\)-perfect graphs (Q1376056) (← links)
- A family of clique divergent graphs with linear growth (Q1376063) (← links)
- Minimum self-repairing graphs (Q1376072) (← links)
- Signed analogs of bipartite graphs (Q1377721) (← links)
- Minimal indecomposable graphs (Q1382817) (← links)
- On clique-complete graphs (Q1382831) (← links)
- On self-complementary chordal graphs (Q1383060) (← links)
- Characterization of a class of edge-regular graphs (Q1390367) (← links)
- Composite planar coverings of graphs (Q1398265) (← links)