The following pages link to Ladislav Nebeský (Q190566):
Displaying 50 items.
- Guides and shortcuts in graphs (Q383749) (← links)
- Distance-hereditary graphs and signpost systems (Q960964) (← links)
- Axiomatic characterization of the interval function of a graph (Q1024316) (← links)
- A note on 1-factors in graphs (Q1252872) (← links)
- Greedy \(F\)-colorings of graphs (Q1415540) (← links)
- Hamiltonian colorings of graphs (Q1763479) (← links)
- On Hamiltonian colorings of graphs (Q1772412) (← links)
- Intervals and steps in a connected graph (Q1883264) (← links)
- The interval function of a connected graph and road systems (Q2370446) (← links)
- Left-right double trees (Q2545310) (← links)
- A tree as a finite nonempty set with a binary operation (Q2713706) (← links)
- The interval function of a connected graph and a~characterization of geodetic graphs (Q2760916) (← links)
- (Q3033793) (← links)
- On upper embeddability of complementary graphs (Q3037466) (← links)
- (Q3041220) (← links)
- New proof of a characterization of geodetic graphs (Q3151374) (← links)
- On quasistars in $n$-cubes (Q3329492) (← links)
- A Note on Structural Homonymy and Word Order (Q3336726) (← links)
- Hypergraphs and intervals. II. (Q3346363) (← links)
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph (Q3366581) (← links)
- On Properties of a Graph that Depend on its Distance Function (Q3366641) (← links)
- On signpost systems and connected graphs (Q3366716) (← links)
- Hypergraphs and intervals. III. (Q3476839) (← links)
- On certain extensions of intervals in graphs (Q3476842) (← links)
- Distance defined by spanning trees in graphs (Q3504801) (← links)
- The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs (Q3599870) (← links)
- Travel groupoids (Q3599897) (← links)
- Signpost systems and spanning trees of graphs (Q3599915) (← links)
- (Q3616002) (← links)
- A new approach to chordal graphs (Q3617966) (← links)
- On the distance function of a connected graph (Q3624939) (← links)
- A note on upper embeddable graphs (Q3666871) (← links)
- On a certain numbering of the vertices of a hypergraph (Q3669457) (← links)
- Two edge-disjoint Hamiltonian cycles of powers of a graph (Q3708046) (← links)
- (Q3708051) (← links)
- On locally quasiconnected graphs and their upper embeddability (Q3708824) (← links)
- On 2-cell embeddings of graphs with minimum numbers of regions (Q3712348) (← links)
- Edge-disjoint 1-factors in powers of connected graphs (Q3762354) (← links)
- On a $1$-factor of the fourth power of a connected graph (Q3828042) (← links)
- Embedding $m$-quasistars into $n$-cubes (Q3832587) (← links)
- (Q3859823) (← links)
- On the existence of a $3$-factor in the fourth power of a graph (Q3870937) (← links)
- (Q3897080) (← links)
- (Q3903036) (← links)
- Every connected, locally connected graph is upper embeddable (Q3909074) (← links)
- Regular factors in powers of connected graphs (Q3915023) (← links)
- (Q3926069) (← links)
- Hypergraphs and intervals (Q3927282) (← links)
- On $1$-factors in the cube of a graph (Q3936778) (← links)
- A new characterization of the maximum genus of a graph (Q3939829) (← links)
