Ladislav Nebeský

From MaRDI portal
Person:190566

Available identifiers

zbMath Open nebesky.ladislavWikidataQ24451570 ScholiaQ24451570MaRDI QIDQ190566

List of research outcomes

PublicationDate of PublicationType
Guides and shortcuts in graphs2013-12-06Paper
Distance-hereditary graphs and signpost systems2010-03-29Paper
Axiomatic characterization of the interval function of a graph2009-06-17Paper
On the distance function of a connected graph2009-05-06Paper
A new approach to chordal graphs2009-03-31Paper
https://portal.mardi4nfdi.de/entity/Q36160022009-03-24Paper
The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs2009-02-09Paper
Travel groupoids2009-02-09Paper
Signpost systems and spanning trees of graphs2009-02-09Paper
Distance defined by spanning trees in graphs2008-06-18Paper
The interval function of a connected graph and road systems2007-06-26Paper
Leaps: an approach to the block structure of a graph2006-10-16Paper
A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph2006-02-14Paper
On Properties of a Graph that Depend on its Distance Function2006-02-14Paper
On signpost systems and connected graphs2006-02-14Paper
https://portal.mardi4nfdi.de/entity/Q57085432005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q46779632005-05-23Paper
On Hamiltonian colorings of graphs2005-04-18Paper
Hamiltonian colorings of graphs2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q48287982004-11-26Paper
Radio k-colorings of paths2004-10-27Paper
Modular and median signpost systems and their underlying graphs2004-10-27Paper
Intervals and steps in a connected graph2004-10-01Paper
The Directed Geodetic Structure of a Strong Digraph2004-09-07Paper
An axiomatic approach to metric properties of connected graphs2004-03-21Paper
A theorem for an axiomatic approach to metric properties of graphs2004-03-21Paper
Greedy \(F\)-colorings of graphs2003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q44308372003-10-13Paper
https://portal.mardi4nfdi.de/entity/Q47838032002-12-09Paper
New proof of a characterization of geodetic graphs2002-10-15Paper
https://portal.mardi4nfdi.de/entity/Q27609162001-12-16Paper
The set of geodesics in a graph2001-07-18Paper
https://portal.mardi4nfdi.de/entity/Q27137062001-06-10Paper
An algebraic characterization of geodetic graphs2000-11-13Paper
A new proof of a characterization of the set of all geodesics in a connected graph2000-11-13Paper
https://portal.mardi4nfdi.de/entity/Q49556722000-05-21Paper
On the set of all shortest paths of a given length in a connected graph1998-12-02Paper
Geodesics and steps in a connected graph1998-09-28Paper
https://portal.mardi4nfdi.de/entity/Q48871701997-01-13Paper
A characterization of geodetic graphs1996-07-14Paper
https://portal.mardi4nfdi.de/entity/Q48647651996-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48647811996-02-25Paper
https://portal.mardi4nfdi.de/entity/Q43218391995-08-27Paper
A characterization of the interval function of a connected graph1994-08-25Paper
https://portal.mardi4nfdi.de/entity/Q43016701994-08-14Paper
https://portal.mardi4nfdi.de/entity/Q42773941994-02-07Paper
Local properties and upper embeddability of connected multigraphs1994-01-31Paper
https://portal.mardi4nfdi.de/entity/Q42034841993-09-05Paper
https://portal.mardi4nfdi.de/entity/Q40271841993-02-21Paper
$N_2$-locally connected graphs and their upper embeddability1993-01-16Paper
Route systems and bipartite graphs1992-06-26Paper
On certain extensions of intervals in graphs1990-01-01Paper
Hypergraphs and intervals. III.1988-01-01Paper
On a $1$-factor of the fourth power of a connected graph1988-01-01Paper
Embedding $m$-quasistars into $n$-cubes1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30337931986-01-01Paper
Two edge-disjoint Hamiltonian cycles of powers of a graph1985-01-01Paper
On locally quasiconnected graphs and their upper embeddability1985-01-01Paper
On 2-cell embeddings of graphs with minimum numbers of regions1985-01-01Paper
On quasistars in $n$-cubes1984-01-01Paper
Hypergraphs and intervals. II.1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37080511984-01-01Paper
Edge-disjoint 1-factors in powers of connected graphs1984-01-01Paper
On upper embeddability of complementary graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30412201983-01-01Paper
A Note on Structural Homonymy and Word Order1983-01-01Paper
A note on upper embeddable graphs1983-01-01Paper
On a certain numbering of the vertices of a hypergraph1983-01-01Paper
Algebraic properties of Husimi trees1982-01-01Paper
Every connected, locally connected graph is upper embeddable1981-01-01Paper
Regular factors in powers of connected graphs1981-01-01Paper
Hypergraphs and intervals1981-01-01Paper
On $1$-factors in the cube of a graph1981-01-01Paper
A new characterization of the maximum genus of a graph1981-01-01Paper
On the existence of a $3$-factor in the fourth power of a graph1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39030361980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39260691980-01-01Paper
A note on 1-factors in graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38598231979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38970801979-01-01Paper
On eulerian subgraphs of complementary graphs1979-01-01Paper
On the existence of 1-factors in partial squares of graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41594031978-01-01Paper
On pancyclic line graphs1978-01-01Paper
Some sufficient conditions for the existence of a 1-factor1978-01-01Paper
On partition graphs and generalizations of line graphs1977-01-01Paper
On induced subgraphs of a block1977-01-01Paper
An upper bound for the minimum degree of a graph1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41676131977-01-01Paper
On the minimum degree and edge-connectivity of a graph1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40973161976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41116201976-01-01Paper
A generalization of Hamiltonian cycles for trees1976-01-01Paper
A theorem on $2$-connected graphs1975-01-01Paper
On tree-complete graphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41138681975-01-01Paper
On cubes and dichotomic trees1974-01-01Paper
Reconstruction of a tree from certain maximal proper subtrees1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47758981974-01-01Paper
On the minimum number of vertices and edges in a graph with a given number of spanning trees1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56685051973-01-01Paper
On the line graph of the square and the square of the line graph of a connected graph1973-01-01Paper
On connected graphs containing exactly two points of the same degree1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56506941972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56576601972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56611531972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56184001971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56189081971-01-01Paper
Left-right double trees1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56087871970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56463921970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56463931970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55886581969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56167251969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55498121968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55619651967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55998311966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56093871966-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ladislav Nebeský