𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Colorability of induced matroids

✍ Scribed by Richard A. Brualdi; Amélia Fonseca

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
484 KB
Volume
223-224
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring matroids
Coloring matroids
✍ Raul Cordovil 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Consider a simple matroid M(E) with rank r = 3. We prove that there is no partition E = E1uE2 such that, for every line i of M, at least one of the sets lnEl or lnEz is a singleton. A natural generalization of this result to higher ranks is considered.

Dilworth truncations and k-induced matro
Dilworth truncations and k-induced matroids
✍ Randell A. Stevenson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 440 KB

E+ 2', the subsets I of E such that 11'1 c r&9(1')) k for all non-empty subsets I' of I are the independent sets of a matroid on E. This matroid is said to be k-induced on Q by 4. The aim of this paper is to prove that if k and n are nonnegative integers and M is a matroid on the nth Dilworth trun

Uniqueness of colorability and colorabil
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
✍ David P. Dailey 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 224 KB

It is shown that two sorts of problems belong to the NP-complete clas~;~ First, it is proven that for a given k-colorable graph and a given k-coloring of that graph, determining wbether the graph is or is not uniquely k-colorable is NP-complete. Second, a result by Garey, Johnson, and Stockmeyer is

Edge-colorability of graph bundles
Edge-colorability of graph bundles
✍ Tomazˇ Pisanski; John Shawe-Taylor; Jozˇe Vrabec 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 452 KB