Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Partition 1982-01-01 Paper The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods 1981-01-01 Paper Graph...
    10 bytes (19 words) - 15:55, 10 December 2023
  • sequences 1981-01-01 Paper The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods 1981-01-01 Paper Algebraic...
    10 bytes (19 words) - 23:38, 11 December 2023
  • have Hamiltonian paths 2014-06-27 Paper Cayley graphs of order 16p are hamiltonian 2013-02-07 Paper Cayley graphs of order \(30p\) are Hamiltonian 2012-11-20...
    10 bytes (18 words) - 12:40, 28 January 2024
  • interference 2014-12-02 Paper EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS 2014-04-25 Paper Directed acyclic graphs with the unique dipath property...
    10 bytes (19 words) - 11:24, 9 December 2023
  • 1996-07-18 Paper Kernels in directed graphs: A poison game 1993-06-20 Paper About colorings, stability and paths in directed graphs 1989-01-01 Paper https://portal...
    10 bytes (16 words) - 00:33, 13 December 2023
  • ρ 2 + ρ+ 1 = 0] 1988-01-01 Paper Generalized hamiltonian circuits in the cartesian product of two-directed cycles 1988-01-01 Paper https://portal.mardi4nfdi...
    10 bytes (18 words) - 03:52, 13 December 2023
  • 2001-07-30 Paper Contractible circuits in \(3\)-connected graphs 2000-11-02 Paper Paths and circuits in partially directed graphs 2000-01-02 Paper Cycle...
    10 bytes (19 words) - 10:01, 12 December 2023
  • of even directed graphs 1987-01-01 Paper Counterexamples to Adám's conjecture on arc reversals in directed graphs 1987-01-01 Paper Hamiltonian dicycles...
    10 bytes (17 words) - 17:15, 9 December 2023
  • Nearest Neighbor Optimization of Quantum Circuits 2016-08-10 Paper Using πDDs in the Design of Reversible Circuits 2015-11-30 Paper An Efficient Method for...
    10 bytes (18 words) - 00:35, 11 December 2023
  • algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph 2015-09-30 Paper Partition of a planar...
    10 bytes (18 words) - 03:45, 12 December 2023
  • Problems on Erroneous Reversible Circuits 2016-09-30 Paper Using $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits 2016-08-10 Paper An Efficient...
    10 bytes (16 words) - 16:44, 24 September 2023
  • Paper Hamiltonian paths on 3-polytopes 1972-01-01 Paper Some upper bounds for the diameters of convex polytopes 1972-01-01 Paper Hamiltonian Circuits on Simple...
    10 bytes (18 words) - 07:04, 12 December 2023
  • 1983-01-01 Paper Detection of Hamiltonian circuits in a directed graph 1982-01-01 Paper Stability of a forced system with a single nonlinear element in the feedback...
    10 bytes (18 words) - 10:39, 24 September 2023
  • https://portal.mardi4nfdi.de/entity/Q4200076 1978-01-01 Paper Extremal problems for directed graphs 1973-01-01 Paper On the existence of triangulated spheres in 3-graphs...
    10 bytes (19 words) - 11:00, 12 December 2023
  • port-controlled Hamiltonian systems 2002-09-05 Paper An LMI approach to stabilization of linear port-controlled Hamiltonian systems 2002-07-15 Paper Hamiltonian formulation...
    10 bytes (23 words) - 12:50, 8 December 2023
  • problem 2010-04-28 Paper Spanning Directed Trees with Many Leaves 2010-03-17 Paper FPT algorithms and kernels for the directed \(k\)-leaf problem 2010-02-12...
    10 bytes (18 words) - 10:09, 8 December 2023
  • algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph 2015-09-30 Paper A polynomial algorithm...
    10 bytes (18 words) - 13:10, 7 October 2023
  • arcs 1988-01-01 Paper Hamiltonian dicycles avoiding prescribed arcs in tournaments 1987-01-01 Paper A note on f-factors in directed and undirected multigraphs...
    10 bytes (16 words) - 08:58, 6 October 2023
  • 1989-01-01 Paper Semi-independence number of a graph and the existence of Hamiltonian circuits 1987-01-01 Paper Project scheduling with resource constraints: A...
    10 bytes (17 words) - 03:12, 13 December 2023
  • algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph 2015-09-30 Paper Probabilistic analysis...
    10 bytes (18 words) - 03:38, 12 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)