Person:1160633: Difference between revisions

From MaRDI portal
Person:1160633
m AuthorDisambiguator moved page Person:598470 to Heinz-Juergen Voss: Duplicate
m AuthorDisambiguator moved page Heinz-Juergen Voss to Heinz-Juergen Voss: Duplicate
 
(No difference)

Latest revision as of 19:50, 8 December 2023

Available identifiers

zbMath Open voss.heinz-jurgenDBLP46/4072WikidataQ1500006 ScholiaQ1500006MaRDI QIDQ1160633

List of research outcomes





PublicationDate of PublicationType
Short disjoint cycles in graphs with degree constraints2024-01-05Paper
https://portal.mardi4nfdi.de/entity/Q28160482016-07-01Paper
https://portal.mardi4nfdi.de/entity/Q28161072016-07-01Paper
Light subgraphs of graphs embedded in the plane. A survey2013-03-01Paper
Hamilton cycles in prisms2008-01-04Paper
The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 52007-04-26Paper
Circular mixed hypergraphs. II: The upper chromatic number2006-06-30Paper
Coloring mixed hypertrees2006-04-28Paper
Light paths with an odd number of vertices in polyhedral maps2006-02-14Paper
https://portal.mardi4nfdi.de/entity/Q57085882005-11-18Paper
A note on group colorings2005-11-07Paper
https://portal.mardi4nfdi.de/entity/Q46803102005-06-07Paper
Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds2005-03-08Paper
Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds2005-02-09Paper
Light classes of generalized stars in polyhedral maps on surfaces2004-10-27Paper
Mixed hypercacti2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48128722004-08-23Paper
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs2004-08-06Paper
Edge-disjoint odd cycles in planar graphs.2004-03-15Paper
Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 92004-02-03Paper
https://portal.mardi4nfdi.de/entity/Q44329402004-01-13Paper
Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.2003-08-17Paper
On k-trestles in polyhedreal graphs2003-06-13Paper
On the number of nonisomorphic orientable regular embeddings of complete graphs2002-12-10Paper
Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.2002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q47791662002-11-25Paper
Connected (g, f)-factors2002-10-24Paper
Light subgraphs of multigraphs on compact 2-dimensional manifolds2002-10-09Paper
https://portal.mardi4nfdi.de/entity/Q45295142002-08-24Paper
https://portal.mardi4nfdi.de/entity/Q27666892002-07-09Paper
Subgraphs with restricted degrees of their vertices in polyhedral maps on compact 2-manifolds2002-06-16Paper
https://portal.mardi4nfdi.de/entity/Q44100272002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27183492001-09-24Paper
https://portal.mardi4nfdi.de/entity/Q27413562001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q27313682001-07-29Paper
https://portal.mardi4nfdi.de/entity/Q49498692001-03-06Paper
https://portal.mardi4nfdi.de/entity/Q44885672001-01-29Paper
Sachs triangulations and infinite sequences of regular maps on given type2000-11-02Paper
A local property of polyhedral maps on compact two-dimensional manifolds2000-10-18Paper
Subgraphs with restricted degrees of their vertices in large polyhedral maps on compact two-manifolds2000-04-26Paper
A local property of large polyhedral maps on compact 2-dimensional manifolds2000-04-04Paper
https://portal.mardi4nfdi.de/entity/Q47010301999-11-09Paper
Light paths with an odd number of vertices in large polyhedral maps1999-10-25Paper
Short disjoint cycles in graphs with degree constraints1996-07-07Paper
https://portal.mardi4nfdi.de/entity/Q48824781996-06-16Paper
Sachs triangulations and regular maps1995-05-28Paper
https://portal.mardi4nfdi.de/entity/Q39978871992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q31996281990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32044931990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33481961990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38190961989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38326001989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57508861989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30290321986-01-01Paper
Independent sets in k-chromatic graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34704871985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36867551985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36988241985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37554781985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32181531984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37895871984-01-01Paper
Graphs having circuits with at least two chords1982-01-01Paper
Bridges of longest circuits and path coverings of labelled trees1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39646051982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38841381980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41878611978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41219221977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41418441977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41920931977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41755831975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47758801974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44019721973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44019731973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56176401970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56176411970-01-01Paper
Eigenschaften von Graphen, die keine k+1 knotenfremde Kreise enthalten1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56007491969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55396551968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55541581968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55706581967-01-01Paper

Research outcomes over time

This page was built for person: Heinz-Juergen Voss