COMBINATORICS 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMBINATORICS-2006 Paper

173

click to vote

COMBINATORICS
2006

317views more COMBINATORICS 2006»

Colorings and Orientations of Matrices and Graphs

14 years 11 months ago

Download www.combinatorics.org

Uwe Schauz

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	317	Colorings and Orientations of Matrices and Graphs	claim
2	290	On the Limiting Distribution for the Length of the Longest Alternating Sequence in a Random Permutation	claim
3	286	On a Balanced Property of Derangements	claim
4	276	On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs	claim
5	271	An Ehrhart Series Formula For Reflexive Polytopes	claim
6	221	Kernels of Directed Graph Laplacians	claim
7	183	On Oriented Arc-Coloring of Subcubic Graphs	claim
8	169	The Diameter and Laplacian Eigenvalues of Directed Graphs	claim
9	162	Bounding the Partition Function of Spin-Systems	claim
10	158	Reduced Canonical Forms of Stoppers	claim
11	156	Total Domination and Matching Numbers in Claw-Free Graphs	claim
12	155	Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem	claim
13	153	BG-Ranks and 2-Cores	claim
14	153	Combinatorics of the Free Baxter Algebra	claim
15	153	The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs	claim
16	147	A Survey on Packing and Covering Problems in the Hamming Permutation Space	claim
17	147	Domino Fibonacci Tableaux	claim
18	144	Weighted Zeta Functions of Graph Coverings	claim
19	144	On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups	claim
20	142	Parameter Augmentation for Two Formulas	claim
21	142	The Zeta Function of a Hypergraph	claim
22	141	Binary Words Containing Infinitely Many Overlaps	claim
23	140	Characterization of [1, k]-Bar Visibility Trees	claim
24	137	Three-Letter-Pattern-Avoiding Permutations and Functional Equations	claim
25	136	3-Designs from PGL(2, q)	claim
26	135	Drawing a Graph in a Hypercube	claim
27	135	Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions	claim
28	134	Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers	claim
29	133	Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees	claim
30	132	Double Crystals of Binary and Integral Matrices	claim
31	132	On Computing the Distinguishing Numbers of Trees and Forests	claim
32	131	Encores on Cores	claim
33	130	A Note on Exponents vs Root Heights for Complex Simple Lie Algebras	claim
34	130	Fractional Biclique Covers and Partitions of Graphs	claim
35	129	Descendants in Increasing Trees	claim
36	128	On Lengths of Rainbow Cycles	claim
37	127	The Generating Function of Ternary Trees and Continued Fractions	claim
38	126	Plethysm for Wreath Products and Homology of Sub-Posets of Dowling Lattices	claim
39	126	The Induced Subgraph Order on Unlabelled Graphs	claim
40	126	Bounding the Number of Edges in Permutation Graphs	claim
41	126	Constructions of Representations of Rank Two Semisimple Lie Algebras with Distributive Lattices	claim
42	125	A Point in Many Triangles	claim
43	124	Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness	claim
44	124	A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics	claim
45	124	Cubic Partial Cubes from Simplicial Arrangements	claim
46	123	The Non-Crossing Graph	claim
47	123	A Matrix Representation of Graphs and its Spectrum as a Graph Invariant	claim
48	122	Adding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter	claim
49	121	Identifying Graph Automorphisms Using Determining Sets	claim
50	121	Edge and Total Choosability of Near-Outerplanar Graphs	claim
51	121	Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size	claim
52	121	Combinatorics of Partial Derivatives	claim
53	121	Permutation Reconstruction from Minors	claim
54	121	Asymptotics for Incidence Matrix Classes	claim
55	120	Cycle Lengths in a Permutation are Typically Poisson	claim
56	119	Relaxations of Ore's Condition on Cycles	claim
57	118	Counting d-Polytopes with d+3 Vertices	claim
58	118	Noncrossing Trees and Noncrossing Graphs	claim
59	117	Proof of the Razumov-Stroganov Conjecture for some Infinite Families of Link Patterns	claim
60	116	The Circular Chromatic Index of Flower Snarks	claim
61	116	A Combinatorial Derivation of the PASEP Stationary State	claim
62	116	Classifying Descents According to Equivalence mod k	claim
63	116	Neighbour-Distinguishing Edge Colourings of Random Regular Graphs	claim
64	115	Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order	claim
65	114	The Distinguishing Chromatic Number	claim
66	114	The Maximum Distinguishing Number of a Group	claim
67	114	Total 4-Choosability of Series-Parallel Graphs	claim
68	114	Hayman Admissible Functions in Several Variables	claim
69	113	Tilings of the Sphere with Right Triangles II: The (1, 3, 2), (0, 2, n) Subfamily	claim
70	113	Inversions Within Restricted Fillings of Young Tableaux	claim
71	113	Monochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter	claim
72	112	More Forbidden Minors for Wye-Delta-Wye Reducibility	claim
73	112	Shift-Induced Dynamical Systems on Partitions and Compositions	claim
74	112	Latin Squares with Forbidden Entries	claim
75	110	Jamming and Geometric Representations of Graphs	claim
76	110	A Gessel-Viennot-Type Method for Cycle Systems in a Directed Graph	claim
77	109	The Strongly Regular (45, 12, 3, 3) Graphs	claim
78	108	Dynamic Single-Pile Nim Using Multiple Bases	claim
79	108	Discrepancy of Symmetric Products of Hypergraphs	claim
80	108	Grothendieck Bialgebras, Partition Lattices, and Symmetric Functions in Noncommutative Variables	claim
81	107	Matchings Avoiding Partial Patterns and Lattice Paths	claim
82	107	The Linear Complexity of a Graph	claim
83	107	Covering Codes for Hats-on-a-line	claim
84	107	A Note on the Number of Hamiltonian Paths in Strong Tournaments	claim
85	107	On the Symmetry of the Distribution of k-Crossings and k-Nestings in Graphs	claim
86	106	Tilings by Translation: Enumeration by a Rational Language Approach	claim
87	105	A New Table of Constant Weight Codes of Length Greater than 28	claim
88	105	Sets of Points Determining Only Acute Angles and Some Related Colouring Problems	claim
89	105	Matchings Avoiding Partial Patterns	claim
90	105	New Upper Bound for a Class of Vertex Folkman Numbers	claim
91	105	Edge-Magic Group Labellings of Countable Graphs	claim
92	104	Perfect Matching Preservers	claim
93	104	Factorial Grothendieck Polynomials	claim
94	103	A Note on Domino Shuffling	claim
95	102	Distribution of Crossings, Nestings and Alignments of Two Edges in Matchings and Partitions	claim
96	102	Identifying X-Trees with Few Characters	claim
97	102	Discrepancy of Sums of Three Arithmetic Progressions	claim
98	102	Tensorial Square of the Hyperoctahedral Group Coinvariant Space	claim
99	101	Optimal Penney Ante Strategy via Correlation Polynomial Identities	claim
100	100	Parity Versions of 2-Connectedness	claim
101	100	Grid Classes and the Fibonacci Dichotomy for Restricted Permutations	claim
102	99	Hard Squares with Negative Activity and Rhombus Tilings of the Plane	claim
103	98	A Few More Cyclic Steiner 2-Designs	claim
104	98	Restricted Walks in Regular Trees	claim
105	98	Shift Equivalence of P-finite Sequences	claim
106	98	From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets	claim
107	97	H-Free Graphs of Large Minimum Degree	claim
108	96	A New Statistic on Linear and Circular r-Mino Arrangements	claim
109	95	Nilpotent Singer Groups	claim
110	94	Some Results on Odd Astral Configurations	claim
111	92	Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes	claim
112	92	Equitable Matroids	claim
113	92	The Polytope of Degree Partitions	claim
114	91	Proof of an Intersection Theorem via Graph Homomorphisms	claim
115	90	On the Number of Possible Row and Column Sums of 0, 1-Matrices	claim
116	89	Rainbow H-factors	claim
117	88	Tilings of the Sphere with Right Triangles I: The Asymptotically Right Families	claim
118	87	Optimal Four-Dimensional Codes over GF(8)	claim
119	83	A Permutation Regularity Lemma	claim
120	83	Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers