ENDM 2007 - PDF Preprint Papers

ENDM 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ENDM-2007 Paper

click to vote

ENDM
2007

149views more ENDM 2007»

Oriented vertex and arc colorings of partial 2-trees

14 years 12 days ago

Download www.lri.fr

d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...

Pascal Ochem, Alexandre Pinlou

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	149	Oriented vertex and arc colorings of partial 2-trees	claim
2	140	Acyclic dominating partitions	claim
3	114	The Connectivity of addition Cayley graphs	claim
4	111	Claw-free circular-perfect graphs	claim
5	106	Removing Even Crossings on Surfaces	claim
6	104	Matching graphs of Hypercubes and Complete Bipartite Graphs	claim
7	100	Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey	claim
8	96	Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples	claim
9	93	Measurable sets with excluded distances	claim
10	93	Bijective counting of plane bipolar orientations	claim
11	91	Game chromatic number of Cartesian product graphs	claim
12	91	On facets of stable set polytopes of claw-free graphs with stability number three	claim
13	89	Homomorphisms and Polynomial Invariants of Graphs	claim
14	89	Nonrepetitive colorings of graphs	claim
15	88	Graph coloring with no large monochromatic components	claim
16	85	Fast winning strategies in positional games	claim
17	81	Kernel perfect and critical kernel imperfect digraphs structure	claim
18	78	The Interval Liar Game	claim
19	78	Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets	claim
20	76	Folding and Spiralling: The Word View	claim
21	75	Graph classes with given 3-connected components: asymptotic counting and critical phenomena	claim
22	74	The order of the largest complete minor in a random graph	claim
23	73	Two New Classes of Hamiltonian Graphs: (Extended Abstract)	claim
24	70	Hamiltonian fault-tolerance of hypercubes	claim
25	69	Feasibility of the Mixed Postman Problem with Restrictions on the Edges	claim
26	68	List Colouring Squares of Planar Graphs	claim
27	68	Detecting induced subgraphs	claim
28	66	Bijective combinatorics of positive braids	claim
29	66	Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors	claim
30	65	The crossing number of a projective graph is quadratic in the face-width	claim
31	64	The complexity of the Weight Problem for permutation groups	claim
32	64	Some extensions of the Cauchy-Davenport theorem	claim
33	62	Ramsey numbers of sparse hypergraphs	claim
34	61	Extremal Graph Theory for Metric Dimension and Diameter	claim
35	60	Embedding spanning subgraphs of small bandwidth	claim
36	60	Bounds on the Number of Maximal Sum-Free Sets	claim
37	59	Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)	claim
38	56	Constrained Ramsey Numbers	claim
39	52	Induced trees in triangle-free graphs	claim
40	48	On Finite Maximal Antichains in the Homomorphism Order	claim
41	47	Induced Ramsey-type theorems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers