DM 2010 - PDF Preprint Papers

DM 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DM-2010 Paper

click to vote

DM
2010

144views more DM 2010»

Balanced Cayley graphs and balanced planar graphs

13 years 4 months ago

Download www.cs.uleth.ca

A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...

Joy Morris, Pablo Spiga, Kerri Webb

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	144	Balanced Cayley graphs and balanced planar graphs	claim
2	143	Acyclic improper colourings of graphs with bounded maximum degree	claim
3	140	Online Ramsey games for triangles in random graphs	claim
4	135	On convexification of polygons by pops	claim
5	134	The discrepancy of the lex-least de Bruijn sequence	claim
6	132	Diameter and connectivity of 3-arc graphs	claim
7	131	Planar graphs without adjacent cycles of length at most seven are 3-colorable	claim
8	131	On a construction of graphs with high chromatic capacity and large girth	claim
9	129	Interpolating between bounds on the independence number	claim
10	128	Some remarks on the geodetic number of a graph	claim
11	127	Enumeration and limit laws of dissections on a cylinder	claim
12	126	Asymptotic connectivity of hyperbolic planar graphs	claim
13	124	Asymptotic enumeration of 2-covers and line graphs	claim
14	124	Perfect dodecagon quadrangle systems	claim
15	123	On the combinatorics of Galois numbers	claim
16	120	Collineations and dualities of partial geometries	claim
17	119	All countable monoids embed into the monoid of the infinite random graph	claim
18	119	Influences of monotone Boolean functions	claim
19	118	Closure concept for 2-factors in claw-free graphs	claim
20	118	Discrepancy and signed domination in graphs and hypergraphs	claim
21	117	The distinguishing chromatic number of Cartesian products of two complete graphs	claim
22	116	Linear sets in finite projective spaces	claim
23	115	Edge colouring by total labellings	claim
24	115	Finite geometry and the Gale transform	claim
25	115	Walking in circles	claim
26	114	Remarks on a generalization of the Davenport constant	claim
27	109	The thickness and chromatic number of r-inflated graphs	claim
28	108	Internally 4-connected binary matroids with cyclically sequential orderings	claim
29	108	Grundy number and products of graphs	claim
30	108	Locally toroidal polytopes and modular linear groups	claim
31	108	On Barnette's conjecture	claim
32	107	An analytic approach to stability	claim
33	107	Degree-associated reconstruction number of graphs	claim
34	105	Closure and forbidden pairs for 2-factors	claim
35	105	On k-minimum and m-minimum edge-magic injections of graphs	claim
36	103	Packing disjoint cycles over vertex cuts	claim
37	103	Degree-bounded factorizations of bipartite multigraphs and of pseudographs	claim
38	103	Rainbow paths	claim
39	103	The hyperplanes of DQ-(7, k) arising from embedding	claim
40	102	Covering graphs with matchings of fixed size	claim
41	99	Posets, homomorphisms and homogeneity	claim
42	99	Coloring the square of the Cartesian product of two cycles	claim
43	99	Perfect octagon quadrangle systems	claim
44	98	Idomatic partitions of direct products of complete graphs	claim
45	97	Random preorders and alignments	claim
46	97	On Kramer-Mesner matrix partitioning conjecture	claim
47	96	How to play the Majority game with a liar	claim
48	96	On well-rounded sublattices of the hexagonal lattice	claim
49	96	Long cycles and paths in distance graphs	claim
50	95	Constructions of unitals in Desarguesian planes	claim
51	94	Hypermap operations of finite order	claim
52	94	Amalgams of extremal matroids with no U2, l+2-minor	claim
53	94	Brick partitions of graphs	claim
54	91	Adjacency posets of planar graphs	claim
55	90	The firefighter problem for cubic graphs	claim
56	90	Knights, spies, games and ballot sequences	claim
57	89	Large induced subgraphs with equated maximum degree	claim
58	89	Polynomial-time dualization of r-exact hypergraphs with applications in geometry	claim
59	89	Unavoidable topological minors of infinite graphs	claim
60	88	Multidimensional generalized automatic sequences and shape-symmetric morphic words	claim
61	87	Hamilton-chain saturated hypergraphs	claim
62	86	Minimum congestion spanning trees in planar graphs	claim
63	86	On the simple connectedness of hyperplane complements in dual polar spaces, II	claim
64	85	Hamiltonian decompositions of complete k-uniform hypergraphs	claim
65	83	Packing edge-disjoint cycles in graphs and the cyclomatic number	claim
66	83	Not complementary connected and not CIS d-graphs form weakly monotone families	claim
67	83	Polychromatic colorings of arbitrary rectangular partitions	claim
68	82	The complexity of the weight problem for permutation and matrix groups	claim
69	82	Every SOMA(n-2, n) is Trojan	claim
70	81	Graphically abelian groups	claim
71	79	Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality	claim
72	79	Decomposing triples into cyclic designs	claim
73	79	On the interlace polynomials of forests	claim
74	78	Injective colorings of sparse graphs	claim
75	78	Transitive bislim geometries of gonality 3, Part II: The group theoretic cases	claim
76	77	Hall-Littlewood polynomials and fixed point enumeration	claim
77	77	Representing (0, 1)-matrices by boolean circuits	claim
78	77	Strong embeddings of minimum genus	claim
79	76	Antibandwidth of three-dimensional meshes	claim
80	76	Enumeration of unrooted hypermaps of a given genus	claim
81	75	Acyclic, or totally tight, two-person game forms: Characterization and main properties	claim
82	75	On the topological lower bound for the multichromatic number	claim
83	71	Max k-cut and judicious k-partitions	claim
84	69	Optimal 1-planar graphs which triangulate other surfaces	claim
85	67	The total linear discrepancy of an ordered set	claim
86	66	Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree	claim
87	66	The local spectra of regular line graphs	claim
88	65	Decomposition of sparse graphs, with application to game coloring number	claim
89	63	A little statistical mechanics for the graph theorist	claim
90	60	The number of irreducible polynomials of degree n over Fq with given trace and constant terms	claim
91	55	Generating self-complementary uniform hypergraphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers