Coloring of pseudocubic graphs in three colors
DOI10.3103/S0278641919020079zbMATH Open1445.05042OpenAlexW2949388150WikidataQ127712349 ScholiaQ127712349MaRDI QIDQ2287152FDOQ2287152
Authors: M. V. Mel'nik, A. V. Astakhova, Svetlana N. Selezneva 
Publication date: 23 January 2020
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s0278641919020079
Recommendations
chromatic numbercubic graphsubcubic graphpolynomial algorithmdegree of vertex3-coloring of graphscoloring of verticespseudocubic graph
Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- 4-coloring \(H\)-free graphs when \(H\) is small
- Title not available (Why is that?)
- Updating the complexity status of coloring graphs without a fixed induced linear forest
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- Some simplified NP-complete graph problems
- Title not available (Why is that?)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices
Cited In (11)
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
- 3-colouring for dually chordal graphs and generalisations
- Three-edge-colouring doublecross cubic graphs
- Cyclic colorings of 3-polytopes with large maximum face size
- Voloshin's colourings of \(P_{3}\)-designs
- Method of 3-colouring of graphs
- On 3-hued coloring of graphs
- A generalization of Tait coloring cubic graphs
- On 3-colorings of bipartitep-threshold graphs
- 3-consecutive C-colorings of graphs
- Acyclic 3-coloring of generalized Petersen graphs
This page was built for publication: Coloring of pseudocubic graphs in three colors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287152)
