The following pages link to Bohdan Zelinka (Q190573):
Displaying 50 items.
- Paired-domination in inflated graphs (Q596115) (← links)
- (Q677746) (redirect page) (← links)
- On representation of lattices by lattices of semigroups (Q677747) (← links)
- Irredundancy in circular arc graphs (Q686248) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- Extremal graphs domination insensitive to the removal of \(k\) edges (Q686272) (← links)
- Domination properties and induced subgraphs (Q686437) (← links)
- Diameter lower bounds for Waring graphs and multiloop networks (Q686473) (← links)
- Lattice valuations, medians and majorities (Q686486) (← links)
- Bounds relating generalized domination parameters (Q687110) (← links)
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number (Q687719) (← links)
- On a problem concerning tolerance graphs (Q689957) (← links)
- Lower bound of the Hadwiger number of graphs by their average degree (Q760439) (← links)
- On an isomorphism problem on the closed-set lattice of a graph (Q761474) (← links)
- Representation theorems for graphs whose vertex set is partially ordered (Q762181) (← links)
- Medians in median graphs (Q791544) (← links)
- Coherence, regularity and permutability of congruences (Q792364) (← links)
- Recharacterizing Eulerian: Intimations of new duality (Q798673) (← links)
- Tolerance graphs (Q798675) (← links)
- Two theorems on Hamiltonian graphs (Q800937) (← links)
- Counting formulas for glued lattices (Q800946) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- On the graph of large distances (Q908937) (← links)
- On a neighborhood condition implying the existence of disjoint complete graphs (Q911615) (← links)
- A Tutte polynomial for signed graphs (Q912115) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Comparability invariance of the fixed point property (Q1065836) (← links)
- Cycle covering in bridgeless graphs (Q1069955) (← links)
- The line neighbourhood number of a graph (Q1080431) (← links)
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs (Q1084418) (← links)
- A class of graphs containing the polar spaces (Q1084420) (← links)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- Generalized language equations with multiple solutions (Q1084871) (← links)
- On the problem of bandsize (Q1089353) (← links)
- On local convexity in graphs (Q1089354) (← links)
- Large induced degenerate subgraphs (Q1092059) (← links)
- A\(\times A\) congruence coherent implies A congruence permutable (Q1096657) (← links)
- Sur le nombre domatique du n-cube et une conjecture de Zelinka. (On the domatic number of the n-cube and a conjecture of Zelinka) (Q1100480) (← links)
- Equivalence structures and their automorphisms (Q1101821) (← links)
- A unified approach to domination problems on interval graphs (Q1111566) (← links)
- The number of linear extensions of bipartite graphs (Q1114718) (← links)
- A unified framework for disambiguating finite transductions (Q1115635) (← links)
- On the product of upper irredundance numbers of a graph and its complement (Q1119604) (← links)
- Products of graphs with their closed-set lattices (Q1119944) (← links)
- Generalized domination and efficient domination in graphs (Q1126173) (← links)
- On the bondage number of a graph (Q1126221) (← links)
- Regular totally domatically full graphs (Q1174127) (← links)
- Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
- Graph minors. X: Obstructions to tree-decomposition (Q1179473) (← links)
- The Steiner ratio for five points (Q1179750) (← links)
