UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 72

Sortiert nach

Uniquely Hamiltonian Graphs of Minimum Degree 4

Journal of graph theory, 2014-02, Vol.75 (2), p.167-177

Fleischner, Herbert

2014

Volltextzugriff (PDF)

The most general structure of graphs with hamiltonian or hamiltonian connected square

Discrete mathematics, 2024-01, Vol.347 (1), p.113702, Article 113702

2024

Volltextzugriff (PDF)

Reducing an arbitrary fullerene to the dodecahedron

Discrete mathematics, 2017-11, Vol.340 (11), p.2714-2722

Fleischner, Herbert

2017

Volltextzugriff (PDF)

A best possible result for the square of a 2-block to be hamiltonian

Discrete mathematics, 2021-01, Vol.344 (1), p.112158, Article 112158

2021

Volltextzugriff (PDF)

A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three

Applied mathematics and computation, 2020-09, Vol.380, p.125233, Article 125233

2020

Volltextzugriff (PDF)

Eulerian Graphs and Related Topics

1, 1991

Volltextzugriff (PDF)

Cycle Double Covers in Cubic Graphs having Special Structures: CYCLE DOUBLE COVERS IN CUBIC GRAPHS

Journal of graph theory, 2014-09, Vol.77 (2), p.158-170

2014

Volltextzugriff (PDF)

Cycle covers (III) – Compatible circuit decomposition and K5-transition minor

Journal of combinatorial theory. Series B, 2019-07, Vol.137, p.25-54

2019

Volltextzugriff (PDF)

A model for finding transition-minors

Discrete Applied Mathematics, 2020-09, Vol.283, p.242-264

2020

Volltextzugriff (PDF)

Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture

Journal of graph theory, 2021-02, Vol.96 (2), p.269-288

2021

Volltextzugriff (PDF)

Cycle double covers via Kotzig graphs

Journal of combinatorial theory. Series B, 2019-03, Vol.135, p.212-226

2019

Volltextzugriff (PDF)

A universal set of growth operations for fullerenes

Chemical physics letters, 2008-10, Vol.464 (1), p.118-121

2008

Volltextzugriff (PDF)

Cycle double covers containing certain circuits in cubic graphs having special structures

Discrete mathematics, 2015-10, Vol.338 (10), p.1750-1754

2015

Volltextzugriff (PDF)

Maximum independent sets in 3- and 4-regular Hamiltonian graphs

Discrete mathematics, 2010-10, Vol.310 (20), p.2742-2749

2010

Volltextzugriff (PDF)

Supereulerian graphs with width s and s-collapsible graphs

Discrete Applied Mathematics, 2016-02, Vol.200, p.79-94

2016

Volltextzugriff (PDF)

A note about the dominating circuit conjecture

Discrete mathematics, 2002-12, Vol.259 (1), p.307-309

2002

Volltextzugriff (PDF)

Covering graphs with few complete bipartite subgraphs

Theoretical computer science, 2009-05, Vol.410 (21), p.2045-2053

2009

Volltextzugriff (PDF)

Cycle Double Covers in Cubic Graphs having Special Structures

Journal of graph theory, 2014-09, Vol.77 (2), p.158-170

2014

Volltextzugriff (PDF)

Supereulerian graphs with width and -collapsible graphs

Discrete Applied Mathematics, 2016-02, Vol.200, p.79-94

2016

Volltextzugriff (PDF)

Circuit double covers in special types of cubic graphs: Combinatorics 2006, A Meeting in Celebration of Pavol Hell's 60th Birthday (May 1-5, 2006)

Discrete mathematics, 2009, Vol.309 (18), p.5724-5728

2009

Volltextzugriff (PDF)

Circuit double covers in special types of cubic graphs

Discrete mathematics, 2009-09, Vol.309 (18), p.5724-5728

2009

Volltextzugriff (PDF)

Compatible Cycle Decomposition of bad K5-minor-free graphs

Electronic notes in discrete mathematics, 2017-08, Vol.61, p.445-449

2017

Volltextzugriff (PDF)

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers

Hybrid Metaheuristics, 2016, Vol.9668, p.1-16

2016

Volltextzugriff (PDF)

Ralph Faudree (1938–2015)

Discrete mathematics, 2016-07, Vol.339 (7), p.1828-1836

2016

Volltextzugriff (PDF)

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

Theoretical computer science, 2002-10, Vol.289 (1), p.503-516

2002

Volltextzugriff (PDF)

1 – 25 von 72

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(68)
Mit Volltextzugriff
(72)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Menü

Weitere Dienste

Einstellungen

Uniquely Hamiltonian Graphs of Minimum Degree 4

The most general structure of graphs with hamiltonian or hamiltonian connected square

Reducing an arbitrary fullerene to the dodecahedron

A best possible result for the square of a 2-block to be hamiltonian

A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three

Eulerian Graphs and Related Topics

Cycle Double Covers in Cubic Graphs having Special Structures: CYCLE DOUBLE COVERS IN CUBIC GRAPHS

Cycle covers (III) – Compatible circuit decomposition and K5-transition minor

A model for finding transition-minors

Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture

Cycle double covers via Kotzig graphs

A universal set of growth operations for fullerenes

Cycle double covers containing certain circuits in cubic graphs having special structures

Maximum independent sets in 3- and 4-regular Hamiltonian graphs

Supereulerian graphs with width s and s-collapsible graphs

A note about the dominating circuit conjecture

Covering graphs with few complete bipartite subgraphs

Cycle Double Covers in Cubic Graphs having Special Structures

Supereulerian graphs with width and -collapsible graphs

Circuit double covers in special types of cubic graphs: Combinatorics 2006, A Meeting in Celebration of Pavol Hell's 60th Birthday (May 1-5, 2006)

Circuit double covers in special types of cubic graphs

Compatible Cycle Decomposition of bad K5-minor-free graphs

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers

Ralph Faudree (1938–2015)

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

Suchergebnisse filtern