Result 1 to 20 of 128 total
Isomorphism checking of $I$-graphs. (English)
Graphs Comb. 28, No. 6, 823-830 (2012).
1
Configurations from a graphical viewpoint. (English)
Birkhäuser Advanced Texts. Basler Lehrbücher. Basel: Birkhäuser (ISBN 978-0-8176-8363-4/hbk). xiv, 288~p. EUR~64.15 (2012).
2
A census of edge-transitive planar tilings. (English)
J. Comb. Math. Comb. Comput. 80, 243-265 (2012).
3
HL-index of a graph. (English)
Ars Math. Contemp. 5, No. 1, 99-105 (2012).
4
Flag graphs and their applications in mathematical chemistry for benzenoids. (English)
J. Math. Chem. 50, No. 4, 893-903 (2012).
5
All generalized Petersen graphs are unit-distance graphs. (English)
J. Korean Math. Soc. 49, No. 3, 475-491 (2012).
6
Edge-transitive maps of low genus. (English)
Ars Math. Contemp. 4, No. 2, 385-402 (2011).
7
On the computational complexity of degenerate unit distance representations of graphs. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 274-285 (2011).
8
HOMO-LUMO maps for chemical graphs. (English)
MATCH Commun. Math. Comput. Chem. 64, No. 2, 373-390 (2010).
9
On the extremal values of ratios of number of paths. (English)
Ars Math. Contemp. 3, No. 2, 215-235 (2010).
10
Use of the Szeged index and the revised Szeged index for measuring network bipartivity. (English)
Discrete Appl. Math. 158, No. 17, 1936-1944 (2010).
11
A note on enumeration of one-vertex maps. (English)
Ars Math. Contemp. 3, No. 1, 1-12 (2010).
12
Products of unit distance graphs. (English)
Discrete Math. 310, No. 12, 1783-1792 (2010).
13
Distance-residual subgraphs. (English)
Discrete Math. 310, No. 12, 1653-1660 (2010).
14
Algebraic and topological graph theory (Bled’07), Selected papers based on the presentations at the satellite conferences of the 6th Slovenian conference in graph theory, Lake Bled, Slovenia, June 2007. (English)
Discrete Math. 310, No. 12, 1651-1844 (2010).
15
On the computational complexity of degenerate unit distance representations of graphs (English)
IWOCA, 274-285 (2010).
16
Counting edge-transitive, one-ended, three-connected planar maps with a given growth rate. (English)
Ars Math. Contemp. 2, No. 2, 173-180 (2009).
17
Representing graphs and maps. (English)
Beineke, Lowell W. (ed.) et al., Topics in topological graph theory. With the collaboration of Jonathan L. Gross and Thomas W. Tucker. Cambridge: Cambridge University Press (ISBN 978-0-521-80230-7/hbk). Encyclopedia of Mathematics and its Applications 128, 151-180 (2009).
18
Hamilton cycles in graph bundles over a cycle with tree as a fibre. (English)
Discrete Math. 309, No. 17, 5432-5436 (2009).
19
Edge-contributions of some topological indices and arboreality of molecular graphs. (English)
Ars Math. Contemp. 2, No. 1, 49-58 (2009).
20
Result 1 to 20 of 128 total
Start
Contact
Print
General Help
