The following pages link to Mirka Miller (Q189461):
Displaying 50 items.
- Rees semigroups of digraphs for classification of data. (Q284651) (← links)
- A revised Moore bound for mixed graphs (Q284732) (← links)
- Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269) (← links)
- On the metric dimension of circulant and Harary graphs (Q298410) (← links)
- Wheels are cycle-antimagic (Q324896) (← links)
- Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes (Q383775) (← links)
- The maximum degree and diameter-bounded subgraph in the mesh (Q444444) (← links)
- Degree diameter problem on honeycomb networks (Q477344) (← links)
- (Q510589) (redirect page) (← links)
- A construction of dense mixed graphs of diameter 2 (Q510590) (← links)
- Approximate results for rainbow labelings (Q524169) (← links)
- Nonexistence of graphs with cyclic defect (Q540060) (← links)
- Structural properties of graphs of diameter 2 and defect 2 (Q547528) (← links)
- New results on EX graphs (Q626971) (← links)
- Super \(d\)-antimagic labelings of disconnected plane graphs (Q627559) (← links)
- Construction for antimagic generalized web graphs (Q656134) (← links)
- Construction of antimagic labeling for the Cartesian product of regular graphs (Q691635) (← links)
- A family of mixed graphs with large order and diameter 2 (Q730485) (← links)
- Characterization of eccentric digraphs (Q819811) (← links)
- Multipartite Moore digraphs (Q854866) (← links)
- On mixed Moore graphs (Q868370) (← links)
- Edge-antimagic graphs (Q878610) (← links)
- On irregular total labellings (Q878629) (← links)
- Graphs of order two less than the Moore bound (Q924968) (← links)
- On the connectivity of \((k,g)\)-cages of even girth (Q932601) (← links)
- On consecutive edge magic total labeling of graphs (Q954956) (← links)
- HSAGA and its application for the construction of near-Moore digraphs (Q954960) (← links)
- Complete catalogue of graphs of maximum degree 3 and defect at most 4 (Q967350) (← links)
- Moore bound for mixed networks (Q998428) (← links)
- Diameter-sufficient conditions for a graph to be super-restricted connected (Q1005222) (← links)
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) (Q1026123) (← links)
- On the number of components of \((k,g)\)-cages after vertex deletion (Q1026135) (← links)
- On super \((a,d)\)-edge-antimagic total labeling of disconnected graphs (Q1044921) (← links)
- A note on large graphs of diameter two and given maximum degree (Q1272472) (← links)
- Flattening antichains with respect to the volume (Q1277137) (← links)
- A combinatorial problem in database security (Q1283790) (← links)
- Connected graphs which are not mod sum graphs (Q1296995) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- A note on constructing large Cayley graphs of given degree and diameter by voltage assignments (Q1379133) (← links)
- On the structure of digraphs with order close to the Moore bound (Q1393025) (← links)
- The train marshalling problem (Q1570821) (← links)
- A characterization of strongly chordal graphs (Q1584312) (← links)
- On the existence of radial Moore graphs for every radius and every degree (Q1631613) (← links)
- Characterisation of graphs with exclusive sum labelling (Q1687845) (← links)
- On digraphs of excess one (Q1701127) (← links)
- Digraphs of degree two which miss the Moore bound by two (Q1841909) (← links)
- On Ramsey numbers for trees versus wheels of five or six vertices (Q1865637) (← links)
- Eccentric digraphs (Q1883247) (← links)
- On large bipartite graphs of diameter 3 (Q1937548) (← links)
- Almost Moore digraphs are diregular (Q1978162) (← links)
