EJC 2008 - PDF Preprint Papers

EJC 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EJC-2008 Paper

click to vote

EJC
2008

163views Information Technology» more EJC 2008»

Multiple Kronecker covering graphs

14 years 15 days ago

Download www.imrich.at

A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be uniqu...

Wilfried Imrich, Tomaz Pisanski

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	163	Multiple Kronecker covering graphs	claim
2	163	On digraph coloring problems and treewidth duality	claim
3	161	Labeled posets are universal	claim
4	161	Coloring squares of planar graphs with girth six	claim
5	152	Expansion properties of a random regular graph after random vertex deletions	claim
6	148	On the adaptable chromatic number of graphs	claim
7	139	Majority constraints have bounded pathwidth duality	claim
8	138	Center Fragments for Upscaling and Verification in Database Semantics	claim
9	137	How Psychology and Cognition Can Inform the Creation of Ontologies in Semantic Technologies	claim
10	134	Grad and classes with bounded expansion III. Restricted graph homomorphism dualities	claim
11	127	Factorization formulas for MacDonald polynomials	claim
12	125	Pooling spaces associated with finite geometry	claim
13	124	An Efficient Method for Quick Construction of Web Services	claim
14	123	Deforming Meyer sets	claim
15	122	Fractional coloring and the odd Hadwiger's conjecture	claim
16	122	Dyck paths with coloured ascents	claim
17	122	The distinguishing number of Cartesian products of complete graphs	claim
18	120	Linked partitions and linked cycles	claim
19	117	Grad and classes with bounded expansion II. Algorithmic aspects	claim
20	116	On tension-continuous mappings	claim
21	114	Catalan and Motzkin numbers modulo 4 and 8	claim
22	114	Locating sensors in paths and cycles: The case of 2-identifying codes	claim
23	114	On a class of finite symmetric graphs	claim
24	113	Constructive characterizations of 3-connected matroids of path width three	claim
25	112	Conceptual Modeling of IS-A Hierarchies for XML	claim
26	110	Energy and length in a topological planar quadrilateral	claim
27	107	Pattern classes of permutations via bijections between linearly ordered sets	claim
28	106	3-bounded property in a triangle-free distance-regular graph	claim
29	105	On an involution of Christoffel words and Sturmian morphisms	claim
30	101	Some existence and construction results of polygonal designs	claim
31	101	Locally constrained graph homomorphisms and equitable partitions	claim
32	101	Equivelar maps on the torus	claim
33	98	Graph parameters and semigroup functions	claim
34	95	The upper bound on k-tuple domination numbers of graphs	claim
35	94	Managing Co-reference Knowledge for Data Integration	claim
36	93	A classification of finite partial linear spaces with a primitive rank 3 automorphism group of grid type	claim
37	91	On the number of combinations without certain separations	claim
38	90	A News Index System for Global Comparisons of Many Major Topics on the Earth	claim
39	90	On the 3-distortion of a path	claim
40	90	A dichotomy for minimum cost graph homomorphisms	claim
41	89	Explicit constructions of loops with commuting inner mappings	claim
42	89	Compatible decompositions and block realizations of finite metrics	claim
43	88	A simple proof for open cups and caps	claim
44	88	Partitions and Clifford algebras	claim
45	88	Identifying codes of cycles with odd orders	claim
46	86	Fractional chromatic number of distance graphs generated by two-interval sets	claim
47	86	Genocchi numbers and f-vectors of simplicial balls	claim
48	86	Generalised dualities and maximal finite antichains in the homomorphism order of relational structures	claim
49	85	Characterizations of finite and infinite episturmian words via lexicographic orderings	claim
50	85	Grad and classes with bounded expansion I. Decompositions	claim
51	85	Block transitivity and degree matrices	claim
52	82	Partial ovoids and partial spreads in symplectic and orthogonal polar spaces	claim
53	80	Large sets of Hamilton cycle decompositions of complete bipartite graphs	claim
54	79	Enumeration of almost polynomial rational functions with given critical values	claim
55	79	On Postnikov's hook length formula for binary trees	claim
56	79	A new proof of a theorem of Mansour and Sun	claim
57	78	Tabloids and weighted sums of characters of certain modules of the symmetric groups	claim
58	78	On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency	claim
59	78	Eriksson's numbers game and finite Coxeter groups	claim
60	76	Embeddability of arrangements of pseudocircles into the sphere	claim
61	76	Posets, clique graphs and their homotopy type	claim
62	76	Combinatorial proofs of identities in basic hypergeometric series	claim
63	76	On the automorphism groups of symmetric graphs admitting an almost simple group	claim
64	72	Fix-Mahonian calculus, I: Two transformations	claim
65	70	Substitution tilings with statistical circular symmetry	claim
66	69	The Ramsey numbers for stars of even order versus a wheel of order nine	claim
67	61	On two-path convexity in multipartite tournaments	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers