Author of the publication

Nowhere-zero 3-flows and Z3-connectivity in bipartite graphs.

, and . Discret. Math., 312 (15): 2238-2251 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs., , , , and . Graphs Comb., 29 (2): 275-280 (2013)Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable., , and . Discret. Math., 343 (2): 111661 (2020)Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs., , , , and . J. Graph Theory, 42 (4): 308-319 (2003)A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent 4--Cycles., and . Graphs Comb., 39 (6): 115 (December 2023)Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable., , and . Graphs Comb., 39 (6): 118 (December 2023)Heterogeneous reservoir prediction of ultra-deep strike-slip fault-damaged zone constrained with local seismic anomaly data., , , , , , , , , and . Earth Sci. Informatics, 15 (3): 1427-1441 (2022)Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms., and . Ars Math. Contemp., 10 (1): 85-90 (2016)Degree condition and Z3-connectivity., , and . Discret. Math., 312 (10): 1658-1669 (2012)Nowhere-zero 3-flows and Z3-connectivity in bipartite graphs., and . Discret. Math., 312 (15): 2238-2251 (2012)Every planar graph with girth at least 5 is (1, 9)-colorable., , and . Discret. Math., 345 (6): 112818 (2022)