Decision Trees in Proper Edge k-coloring of Cubic Graphs by Adam Dudáš, Bianka Modrovičová

“…This work examines the possibilities of increasing the efficiency of the computation of proper edge k-coloring of cubic graph with the use of machine learning methods. …”
Get full text

Some bound of the edge chromatic surplus of certain cubic graphs by Diamantis Koreas

“…Working in the same sense as in this paper we give an upper bound of the edge chromatic surplus for a special type of cubic graphs, that is the class of bridgeless non-planar cubic graphs in which in each pair of crossing edges, the crossing edges are adjacent to a third edge.…”
Get full text

New Concepts of Vertex Covering in Cubic Graphs with Its Applications by Huiqin Jiang, Ali Asghar Talebi, Zehui Shao, Seyed Hossein Sadati, Hossein Rashmanlou

Subjects: “…cubic graph…”
Get full text

Characterization of Cubic Graphs G with irt(G) = Irt(G) = 2 by Eslahchi Changiz, Haghi Shahab, Jafari Nader

“…In this paper we characterize all cubic graphs G with irt(G) = IRt(G) = 2…”
Get full text

On Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges‎ by Abbas Seify

Subjects: Get full text

Cubic graphs having only k-cycles in each 2-factor by Naoki Matsumoto, Kenta Noguchi, Takamasa Yashima

Get full text

On Semisymmetric Cubic Graphs of Order 20p2, p Prime by Shahsavaran Mohsen, Darafsheh Mohammad Reza

“…In this paper an extension of his result in the case of cubic graphs of order 20p2 is given. We prove that there is no connected cubic semisymmetric graph of order 20p2 or, equivalently, that every connected cubic edge-transitive graph of order 20p2 is necessarily symmetric.…”
Get full text

A Study on Neutrosophic Cubic Graphs with Real Life Applications in Industries by Muhammad Gulistan, Naveed Yaqoob, Zunaira Rashid, Florentin Smarandache, Hafiz Abdul Wahab

Subjects: Get full text

Core Index of Perfect Matching Polytope for a 2-Connected Cubic Graph by Wang Xiumei, Lin Yixun

Subjects: Get full text

I-Cubid: a nonlinear cubic graph-based approach to visualize and in-depth browse Flickr image results by Umer Rashid, Maha Saddal, Abdur Rehman Khan, Sadia Manzoor, Naveed Ahmad

“…This research aims to antecedent the implications of visualization and related in-depth browsing via a multidimensional cubic graph representation over a search engine result page (SERP). …”
Get full text

Constructing Minimally 3-Connected Graphs by João Paulo Costalonga, Robert J. Kingan, Sandra R. Kingan

Subjects: Get full text

Dominating Vertex Covers: The Vertex-Edge Domination Problem by Klostermeyer William F., Messinger Margaret-Ellen, Yeo Anders

Subjects: “…cubic graph…”
Get full text

Cores, Joins and the Fano-Flow Conjectures by Jin Ligang, Steffen Eckhard, Mazzuoccolo Giuseppe

Subjects: “…cubic graphs…”
Get full text

Critical and Flow-Critical Snarks Coincide by Máčajová Edita, Škoviera Martin

Subjects: Get full text

AVD edge-colorings of cubic Halin graphs by Ningge Huang, Lily Chen

Subjects: Get full text

Cubic Cayley graphs with small diameter. by Eugene Curtin

Subjects: Get full text

Decompositions of Cubic Traceable Graphs by Liu Wenzhong, Li Panpan

“…The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. …”
Get full text

Three matching intersection property for matching covered graphs by Hao Lin, Xiumei Wang

“…In connection with Fulkerson's conjecture on cycle covers, Fan and Raspaud proposed a weaker conjecture: For every bridgeless cubic graph $G$, there are three perfect matchings $M_1$, $M_2$, and $M_3$ such that $M_1\cap M_2 \cap M_3=\emptyset$. …”
Get full text

On the max-cut of sparse random graphs by Gamarnik, David, Li, Quan

“…Finally, we also obtain an improved lower bound of (Formula presented.) on the Max-Cut for the random cubic graph or any cubic graph with large girth, improving the previous best bound of 1.33773n.…”
Get full text
Get full text
Get full text

Packing Three-Vertex Paths in a Subcubic Graph by Adrian Kosowski, Michal Malafiejski, Pawel Zyliński

“…We use this result to show that any $2$-connected cubic graph of order $n>8$ has a $P_3$-packing of at least $\lceil 7n/9 \rceil$ vertices.…”
Get full text