DM 2002 - PDF Preprint Papers

DM 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DM-2002 Paper

click to vote

DM
2002

186views more DM 2002»

Coloring Eulerian triangulations of the projective plane

13 years 6 months ago

Download www.sfu.ca

A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...

Bojan Mohar

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.

Id	Views	Title	Status

1	186	Coloring Eulerian triangulations of the projective plane	claim
2	155	Balanced nested designs and balanced arrays	claim
3	134	Covering a hypergraph of subgraphs	claim
4	128	On the Cayley isomorphism problem	claim
5	116	Star forests, dominating sets and Ramsey-type problems	claim
6	114	C4-saturated bipartite graphs	claim
7	114	Existence of resolvable group divisible designs with block size four I	claim
8	110	Cyclic BSEC of block size 3	claim
9	107	Edge clique graphs and some classes of chordal graphs	claim
10	107	A Fibonacci tiling of the plane	claim
11	105	Research problems	claim
12	104	4-connected maximal planar graphs are 4-ordered	claim
13	104	A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph	claim
14	104	Graphs induced by Gray codes	claim
15	102	Ascending subgraph decompositions of regular graphs	claim
16	102	Totally magic graphs	claim
17	102	Infinite antichains of matroids with characteristic set {p}	claim
18	101	Pseudocomplements of closure operators on posets	claim
19	101	On generalized Ramsey numbers	claim
20	100	A branch-and-cut approach for minimum cost multi-level network design	claim
21	100	On cop-win graphs	claim
22	98	On dijoins	claim
23	97	Resonance graphs of catacondensed even ring systems are median	claim
24	96	Chain polynomials and Tutte polynomials	claim
25	95	On the superconnectivity of generalized p-cycles	claim
26	93	A proof of the q, t-Catalan positivity conjecture	claim
27	93	New constructions of non-adaptive and error-tolerance pooling designs	claim
28	92	A local-global principle for vertex-isoperimetric problems	claim
29	91	A disproof of Henning's conjecture on irredundance perfect graphs	claim
30	90	On the average size of sets in intersecting Sperner families	claim
31	89	Fibrations of graphs	claim
32	89	A note on the Gallai-Roy-Vitaver Theorem	claim
33	89	On the distribution of the number of monotone Boolean functions relative to the number of lower units	claim
34	88	Tutte polynomial expansions for 2-separable graphs	claim
35	87	Odd subgraphs and matchings	claim
36	87	Finite locally-quasiprimitive graphs	claim
37	86	A chip-firing game and Dirichlet eigenvalues	claim
38	85	Equimodular curves	claim
39	84	On incidence coloring for some cubic graphs	claim
40	84	On the refined lecture hall theorem	claim
41	83	Pancyclicity in claw-free graphs	claim
42	83	Sums of minima and maxima	claim
43	82	Hilbert functions of ladder determinantal varieties	claim
44	82	Finding a five bicolouring of a triangle-free subgraph of the triangular lattice	claim
45	81	On restricted edge-colorings of bicliques	claim
46	79	On large complete arcs: odd case	claim
47	79	Embedding path designs in 4-cycle systems	claim
48	79	The patterns of permutations	claim
49	78	Hamilton cycles in random subgraphs of pseudo-random graphs	claim
50	78	On the half?half case of the Zarankiewicz problem	claim
51	77	On certain spaces of lattice diagram determinants	claim
52	77	Dirac-type characterizations of graphs without long chordless cycles	claim
53	76	Chromaticity of some families of dense graphs	claim
54	76	Homeomorphs and amallamorphs of the Petersen graph	claim
55	74	On the diameter of the rotation graph of binary coupling trees	claim
56	73	On connectivity of consecutive-d digraphs	claim
57	73	Cyclic Haar graphs	claim
58	72	On approximating the maximum diameter ratio of graphs	claim
59	71	Embedding extended Mendelsohn triple systems	claim
60	70	Shifted quasi-symmetric functions and the Hopf algebra of peak functions	claim
61	70	Image partition regular matrices--bounded solutions and preservation of largeness	claim
62	70	Embedding partial bipartite directed cycle systems	claim
63	69	The three-way intersection problem for latin squares	claim
64	69	Non-chordal graphs having integral-root chromatic polynomials II	claim
65	68	Edge-gracefulness of the composition of paths with null graphs	claim
66	68	On quasiabelian Cayley graphs and graphical doubly regular representations	claim
67	62	On partitions of discrete boxes	claim
68	62	Further decompositions of complete tripartite graphs into 5-cycles	claim
69	62	The exact isoperimetric inequality for ternary and quaternary cubes	claim
70	59	The typenumber of trees	claim
71	59	On pancyclism in hamiltonian graphs	claim
72	56	Strongly adjacency-transitive graphs and uniquely shift-transitive graphs	claim
73	55	On the reconstruction of perfect codes	claim
74	53	L-functions for images of graph coverings by some operations	claim
75	52	Matrix integrals and the counting of tangles and links	claim
76	51	Stirling numbers interpolation using permutations with forbidden subsequences	claim
77	50	On the maximum size of (p, Q)-free families	claim
78	49	The vertex-cover polynomial of a graph	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers