The following pages link to Mirko Horňák (Q186206):
Displaying 50 items.
- On the maximum weight of a dense connected graph of given order and size (Q279225) (← links)
- On the maximum weight of a sparse connected graph of given order and size (Q293629) (← links)
- On the maximum weight of a planar graph of given order and size (Q406330) (← links)
- On the neighbour-distinguishing index of a graph (Q855303) (← links)
- A lower bound for on-line ranking number of a path (Q878626) (← links)
- Another step towards proving a conjecture by Plummer and Toft (Q960952) (← links)
- General neighbour-distinguishing index via chromatic number (Q973148) (← links)
- Minimal \(k\)-rankings for prism graphs (Q992551) (← links)
- On-line arbitrarily vertex decomposable trees (Q997067) (← links)
- On the \(d\)-distance face chromatic number of plane graphs (Q1356701) (← links)
- Asymptotic behaviour of the observability of \(Q_ n\) (Q1377684) (← links)
- Facial incidence colorings of embedded multigraphs (Q1630925) (← links)
- A note on a directed version of the 1-2-3 conjecture (Q1693177) (← links)
- On the palette index of complete bipartite graphs (Q1708394) (← links)
- On the achromatic index of \(K_{q^2+q}\) for a prime \(q\) (Q1889828) (← links)
- On existence of hypergraphs with prescribed edge degree profile (Q1903722) (← links)
- Dense arbitrarily vertex decomposable graphs (Q1928285) (← links)
- On vertex types and cyclic colourings of 3-connected plane graphs (Q1970582) (← links)
- Minimum number of palettes in edge colorings (Q2014713) (← links)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- On arbitrarily vertex decomposable trees (Q2470004) (← links)
- General neighbour-distinguishing index of a graph (Q2470450) (← links)
- On planar graphs arbitrarily decomposable into closed trails (Q2482349) (← links)
- Facial unique-maximum edge and total coloring of plane graphs (Q2659070) (← links)
- 3-facial edge-coloring of plane graphs (Q2689486) (← links)
- Cyclic chromatic number of 3-connected plane graphs (Q2706194) (← links)
- On maximum weight of a bipartite graph of given order and size (Q2866457) (← links)
- Decomposition of bipartite graphs into closed trails (Q3070111) (← links)
- (Q3313884) (← links)
- (p, q)-completability of disk-decompositions, I (Q3320399) (← links)
- (p, q)-completability of disk-decompositions, II (Q3320400) (← links)
- A relationship between the finite groupSp =T2 = (ST)q = E and the (p,q)-completability of disk-decompositions (Q3338436) (← links)
- Achromatic Number of K 5 × K n for Small n (Q3366619) (← links)
- On neighbour-distinguishing colourings from lists (Q3439452) (← links)
- A general upper bound for the cyclic chromatic number of 3‐connected plane graphs (Q3652538) (← links)
- (Q3728864) (← links)
- (Q3828044) (← links)
- (Q4027157) (← links)
- (Q4119818) (← links)
- Localization of jumps of the point-distinguishing chromatic index of K_{n,n} (Q4210667) (← links)
- On a conjecture by Plummer and Toft (Q4237727) (← links)
- Unavoidable set of face types for planar maps (Q4347588) (← links)
- On-line ranking number for cycles and paths (Q4498984) (← links)
- Decomposition of Complete Bipartite Even Graphs into Closed Trails (Q4802830) (← links)
- On the number of 3-polytopes with constant face weight (Q4807474) (← links)
- (Q4822336) (← links)
- On some properties of 4‐regular plane graphs (Q4852402) (← links)
- (Q4865126) (← links)
- (Q4882985) (← links)
- (Q4886768) (← links)
