- Home
- » Tags
- » Cubic graph
Top View
- Minimum Independent Dominating Sets of Random Cubic Graphs
- Pathwidth of Cubic Graphs and Exact Algorithms
- Crossing Number Is Hard for Cubic Graphs
- On a Conjecture of Keedwell and the Cycle Double Cover Conjecture M
- Constructions for Cubic Graphs with Large Girth
- On the Smallest Snarks with Oddness 4 and Connectivity 2 Arxiv:1710.00757V2 [Math.CO] 27 Apr 2018
- Complexity of 3-Edge-Coloring in the Class of Cubic Graphs with a Polyhedral Embedding in an Orientable Surface
- Three-Edge-Colouring Doublecross Cubic Graphs
- Towards a 4/3 Approximation for the Traveling Salesman Problem
- DISTINGUISH HARD INSTANCES of an NP-HARD PROBLEM USING MACHINE LEARNING 1. Introduction Many Combinatorial Optimization Problems
- How to Draw a Tait-Colorable Graph 355
- Excluded Minors in Cubic Graphs
- Perfect Matching and Circuit Cover of Graphs
- A New Heuristic for Detecting Non-Hamiltonicity in Cubic Graphs
- On Cycle Double Covers of Line Graphs
- TSP TOURS in CUBIC GRAPHS: BEYOND 4/3 1. Introduction. the Traveling Salesman Problem
- Decomposition of 3-Connected Cubic Graphs
- Decomposing Planar Cubic Graphs Arxiv:1609.05059V2 [Math.CO] 27
- A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs ∗ Maciej Liskiewicz´ ,Martinr.Schuster
- Integer Flows and Cycle Covers
- On Edge-Decomposition of Cubic Graphs Into Copies of the Double-Star with Four Edges ∗†
- Max-Leaves Spanning Tree Is APX-Hard for Cubic Graphs
- Some APX-Completeness Results for Cubic Graphs
- TSP on Cubic and Subcubic Graphs
- Perfect 1-Factorisations of Cubic Graphs
- Generation of Cubic Graphs Gunnar Brinkmann, Jan Goedgebeur, Brendan D
- CUBIC GRAPH SYMMETRIES Contents 1. Introduction 1 2. Graphs
- NP Completeness of Finding the Chromatic Index of Regular Graphs
- A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs Daniel Král’, Jean-Sébastien Sereni, Michael Stiebitz
- A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP Edwards, Keith; Mcdermid, Eric
- Pebbling in Flower Snark Graph
- Equitable Total Coloring of Corona of Cubic Graphs
- On Incidence Coloring for Some Cubic Graphs
- Relaxed Two-Coloring of Cubic Graphs
- Automated Testing and Interactive Construction of Unavoidable Sets for Graph Classes of Small Path-Width
- On Positive Influence Dominating Sets in Social Networks✩
- The Traveling Salesman Problem for Cubic Graphs
- 1 Introduction
- Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5
- Colourings of Cubic Graphs Inducing Isomorphic Monochromatic Subgraphs Arxiv:1705.06928V2 [Math.CO] 10 Sep 2018
- Simple Cubic Graphs with No Short Traveling Salesman Tour
- Exponential Domination in Subcubic Graphs, Which Is a Special Case That Displays Several Interesting Features
- Open Problem List for the Structural Graph Theory Workshop at Gułtowy 2019∗
- Arxiv:2008.09467V2 [Math.CO] 6 Apr 2021 Facewidth at Least 3 (With the Facewidth of a Plane Graph Defined As Infinite)
- Some Remarks on Domination in Cubic Graphs
- Classifications and Characterizations of Snarks
- Girth Six Cubic Graphs Have Petersen Minors
- Equitable and Semi-Equitable Coloring of Cubic Graphs and Its Application in Batch Scheduling∗
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
- Reductions for the 3-Decomposition Conjecture
- Arxiv:1206.6690V3 [Math.CO] 28 Jun 2013 4.1
- Petersen Cores and the Oddness of Cubic Graphs Arxiv:1501.00860V2
- Lecture 4 1 Petersen's Theorem
- Determining the Circular Flow Number of a Cubic Graph
- On the NP-Completeness of Some Graph Cluster Measures
- On Sylvester Colorings of Cubic Graphs∗
- EVEN POLYHEDRAL DECOMPOSITIONS of CUBIC GRAIPHS Introduction
- POLYHEDRAL EMBEDDINGS of SNARKS in ORIENTABLE SURFACES 1. Introduction by Tait [10], a Cubic (3-Regular) Planar Graph Is 3-Edge
- 1 Lecture 3 Petersen's Theorem